Capacity-achieving codes with bounded graphical complexity on noisy channels

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

Volumn 4, Issue , 2005, Pages 1825-1834

  Hsu, Chun Hao ^a   Anastasopoulos, Achilleas ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (16)

1. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes, " in Proc. ACM Symposium on Theory of Computing, El Paso, Texas, May 1997, pp. 150-159.
2. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes, " in Proc. International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 1-8.
3. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity, " IEEE Trans. Information Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
4. I. Sason and R. Urbanke, "Parity-check density versus performance of binary lin-ear block codes over memoryless symmetric channels, " IEEE Trans. Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
5. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding, " IEEE Trans. Information Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
6. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel, " in Proc. International Symposium on Information Theory, Washinton, DC, June 2001, p. 1.
7. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes, " IEEE Trans. Information Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
8. N. Varnica and M. Fossorier, "Belief-propagation with information correction: im-proved near maximum-likelihood decoding of low-density parity-check codes, " in Proc. International Symposium on Information Theory, Chicago, USA, June 2004, p. 343.
9. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel, " IEEE Trans. Information Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
10. C.-H. Hsu and A. Anastasopoulos, "Capacity-achieving codes with bounded graphical complexity on noisy channels, " Sept. 2005, [Online] . Available: http://arxiv.org/abs/cs/0509062.
11. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
12. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: asymp-totic distance distributions, " IEEE Trans. Information Theory, vol. 48, no. 4, pp. 887-908, Apr. 2002.
13. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing ldpc codes, " IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1115-1131, June 2004.
14. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes, " IEEE Trans. Information Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
15. H. D. Pfister and I. Sason, "Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel with bounded complexity, " in Proc. Allerton Conf. Commun., Control, Comp., Monticello, IL, Sept. 2005, [Online] . Available: http://www.arxiv.org/abs/cs.IT/0509044.
16. H. Pishro-Nik, N. Rahnavard, and F. Fekri, "Nonuniform error correction using low-density parity-check codes, " IEEE Trans. Information Theory, vol. 51, no. 7, pp. 2702-2714, July 2005.