On the parity-check density and achievable rates of LDPC codes for memoryless binary-input output-symmetric channels

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 4, Issue , 2005, Pages 1747-1758

  Wiechman, Gil ^a   Sason, Igal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84961933370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, "Upper bounds on the rate of LDPC codes, " IEEE Trans. on Information Theory, vol. 48, no. 9, pp. 2437-2449, September 2002.
2. R. G. Gallager, Low-density parity-check codes, Cambridge, MA, USA, MIT Press, 1963.
3. H. Jin and R. J. McEliece, "Typical pairs decoding on the AWGN channel, " Proceedings 2000 International Symposium on Information Theory and Its Applications, pp. 180-183, Honolulu, Hawaii, U.S.A., November 5-8, 2000.
4. A. Khandekar and R. J. McEliece, "On the complexity of reliable communications on the erasure channel, " Proceedings 2001 International Symposium on Information Theory, p. 1, Washington, DC, USA, June 24-29, 2001.
5. C. Measson, A. Montanari, T. Richardson and R. Urbanke, "Life above threshold: From list decoding to area theorem and MSE, ", 2004 IEEE Information Theory Workshop, San Antonio, TX, USA, October 24-29, 2004.
6. C. Measson, A. Montanari and R. Urbanke, "Maxwell construction: the hidden bridge between iterative and maximum a posteriori decoding, " submitted to IEEE Trans. on Information Theory, June 2005. [Online] . Available: http://www.arxiv.org/abs/cs.IT/0506083.
7. A. Montanari, "Tight bounds for LDPC codes and LDGM codes under MAP decoding, " IEEE Trans. on Information Theory, vol. 51, no. 9, pp. 3221-3246, September 2005.
8. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity, " IEEE Trans. on Information Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
9. T. Richardson and R. Urbanke, Modern Coding Theory, 2005. [Online] . Available: http://lthcwww.epfl.ch/mct/index.php.
10. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels, " IEEE Trans. on Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
11. I. Sason and G. Wiechman, "On achievable rates and complexity of LDPC codes for parallel chan-nels with application to puncturing, " submitted to IEEE Trans. on Information Theory, August 2005. [Online] . Available: http://arxiv.org/abs/cs.IT/0508072.
12. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity, " in Proceed-ings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lectures Notes in Computer Science 1719, Springer Verlag, pp. 65-76, 1999.
13. G. Wiechman and I. Sason, "Improved bounds on the parity-check density and achievable rates of binary linear block codes with applications to LDPC codes, " submitted to IEEE Trans. on Information Theory, May 2005. See http://arxiv.org/abs/cs.IT/0505057.