Login / Signup
Tightening union bound by applying Verdu theorem for LDPC.
Vu-Duc Ngo
Sin-Chong Park
Published in:
PIMRC (2003)
Keyphrases
</>
lower bound
upper bound
worst case
digital topology
end to end
von neumann