On parity-check matrices with optimal stopping and/or dead-end set enumerators

Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on

Volumn , Issue , 2006, Pages

  Abdel Ghaffar, Khaled A S ^a   Weber, Jos H ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CHANNEL CODING; ECONOMIC AND SOCIAL EFFECTS; ERROR CORRECTION; ITERATIVE DECODING; ITERATIVE METHODS; MATRIX ALGEBRA; TURBO CODES;

DECODING TECHNIQUES; ITERATIVE DECODER; LINEAR BLOCK CODE; OPTIMAL PERFORMANCE; OPTIMAL STOPPING; PARITY CHECK MATRICES; TANNER GRAPHS; WEIGHT ENUMERATOR;

CODES (SYMBOLS);

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

References (13)

1. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes, " IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1115-1131, June 2004.
2. C. Di, D. Proietti, I.E. Telatar, TJ. Richardson, and R.L. Urbanke "Finite-length analysis of low-density parity-check codes on the binary erasure channel, " IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
3. H. D. L. Hollmann and L. M. G. M. Tolhuizen. (2005, July). On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size. arXiv:cs.IT/0507068. [Online]. Available: http://www.arxiv.org/list/cs.IT/0507
4. R. Ikegaya, K. Kasai, T Shibuya, and K. Sakaniwa, "Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles, " Proceedings of the IEEE International Symposium on Information Theory, Chicago, USA, p. 208, June 27-July 2, 2004.
5. N. Kashyap and A. Vardy, "Stopping sets in codes from designs, " Proceedings of the IEEE International Symposium on Information Theory, Yokohama, Japan, p. 122, June 29-July 4, 2003.
6. C. Kelley, D. Sridhara, J. Xu, and J. Rosenthal, "Pseudocode-word weights and stopping sets, " Proceedings of the IEEE International Symposium on Information Theory, Chicago, USA, p. 67, June 27-July 2, 2004.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
8. A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs, " Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 2, June 30-July 5, 2002.
9. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles, " IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 929-953, March 2005.
10. M. Schwartz and A. Vardy. (2005, March). On the stopping distance and the stopping redundancy of codes. arXiv:cs.IT/0503058. [Online]. Available: http://www.arxiv.org/list/cs.IT/0503
11. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes, " Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005.
12. J. H. Weber and K. A. S. Abdel-Ghaffar, "Stopping and deadend set enumerators for binary Hamming codes, " Proceedings of the 26th Symposium on Information Theory in the Benelux, Brussels, Belgium, pp. 165-172, May 19 & 20, 2005.
13. J. H. Weber and K. A. S. Abdel-Ghaffar, "Stopping set analysis for Hamming codes, " Proceedings of the Information Theory Workshop on Coding and Complexity, Rotorua, New Zealand, pp. 244-247, August 28-September 1, 2005.