Block error iterative decoding capacity for LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 52-56

  Jin, Hui ^a   Richardson, Thomas ^a  

^a QUALCOMM INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK ERROR; ITERATIVE DECODING CAPACITY;

DECODING; INFORMATION THEORY; ITERATIVE METHODS;

CODES (SYMBOLS);

EID: 33749424801     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523291     Document Type: Conference Paper

References (15)

1. S. M. Aji, H. Jin, A. Khandekar, D. MacKay, and R. J. McEliece, "BSC Thresholds for Code Ensembles based on 'Typical Pairs' Decoding," Proc. IMA Workshop on Codes and Graphs, August 1999, pp. 195-210.
2. D. Divsalar, H. Jin and R. J. McEliece, "Coding theorems for 'Turbo-Like' Codes," Proc. 36th Allerton Conf. on Communication, Control and Computing, September 1998, pp. 201-210.
3. R. Gallager, Low-Density Parity-Check Codes. Cambridge, Mass.: The M.I.T. Press, 1963.
4. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular Repeat-Accumulative Codes," Proc. 2nd International Symposium on Turbo Codes, Brest France, September 2000, pp. 1-8.
5. H. Jin and R. J. McEliece, "Typical pairs decoding on the AWGN channel," Proc. 2000 International Symp. on Info. Theory and its Applications, Hawaii, November 2000, pp. 180-183.
6. H. Jin, and T. Richardson, "Fast Density Evolution," Proc. 38th Conference on Information Sciences and Systems, Princeton, 2004.
7. M. Lentmaier, D. Truhachev, D. Costello, and K. Ziganirov, "On the Block Error Probability of Iteratively Decoded LDPC Codes," draft.
8. A. Khandekar, and R. J. McEliece, "A Lower Bound on the Iterative Decoding Threshold of Irregular LDPC Code Ensembles," Proc. 36th conefernece on Information Sciences and Systems, Princeton, 2002.
9. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," Proc. 29th ACM Symp. on the Theory of Computing, 1997, pp. 150-159.
10. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low-density codes and improved designs using irregular graphs," Proc. 30th ACM Symp. on the Theory of Computing, 1998, pp. 249-258.
11. D. MacKay, "On Thresholds of Codes," draft, available on MacKay's website.
12. T. J. Richardson, A. Shokrollahi, and R. Urbanke, "Design of provably good low-density parity-check codes," IEEE Trans. on Info. Theory, vol. 47, no. 2, February 2001, pp. 619-637.
13. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message passing decoding," IEEE Trans. on Info. Theory, vol. 47, no. 2, February 2001, pp. 599-618.
14. T. J. Richardson and R. Urbanke, "Multiple-Edge Low-Density Parity-check Codes," submitted to IEEE Trans. on Info. Theory, 2004
15. P. Pfister, I. Sason and R. Urbanke, "Capacity-Achieving Ensembles for the Binary Erasure Channel with Bounded Complexity," Fourth ETH-Technion Meeting on Information Theory and Communications, 2004, Zurich, Switzerland