Title :
Bounds on achievable rates of LDPC codes used over the binary erasure channel
Author :
Barak, Ohad ; Burshtein, David ; Feder, Meir
Author_Institution :
Sch. of Electr. Eng., Tel-Aviv Univ., Israel
Abstract :
We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager´s decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.
Keywords :
binary codes; channel capacity; iterative decoding; parity check codes; polynomials; probability; Gallager´s decoding algorithm; binary erasure channel; iterative decoding; low-density parity-check code; maximum achievable rate; right-degree distribution; Belief propagation; Bipartite graph; Channel capacity; IP networks; Iterative algorithms; Iterative decoding; Parity check codes; Polynomials; Source coding; Upper bound; BEC; Binary erasure channel; LDPC; codes; iterative decoding; low-density parity-check;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.834845
