Login / Signup

On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications.

Igal SasonGil Wiechman
Published in: IEEE Trans. Inf. Theory (2007)
Keyphrases
  • ldpc codes
  • worst case
  • message passing
  • error correction
  • lower bound
  • space complexity
  • information theoretic
  • decoding algorithm
  • low density parity check