Login / Signup

Lower bounds on the graphical complexity of finite-length LDPC codes.

Igal Sason
Published in: ISIT (2009)
Keyphrases
  • lower bound
  • ldpc codes
  • worst case
  • upper bound
  • objective function
  • error correction
  • decoding algorithm
  • message passing
  • computational complexity
  • np hard
  • space complexity
  • rate allocation