When does one redundant parity-check equation matter?

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2006, Pages

  Laendner, Stefan ^a   Hehn, Thorsten ^b   Milenkovic, Olgica ^a   Huber, Johannes B ^b  

^a UCB 450   (United States)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Lov sz local lemma; Margulis code; Redundant parity checks; Trapping sets

Indexed keywords

ADDITIVE NOISE; DECODING; ERROR ANALYSIS; ITERATIVE METHODS;

MARGULIS CODE; REDUNDANT PARITY-CHECKS; TRAPPING SETS;

REDUNDANT MANIPULATORS;

EID: 50949100677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.44     Document Type: Conference Paper

References (15)

1. C. Di, D. Proletti, I. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes," IEEE Trans. on Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
2. D. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, vol. 74, 2003.
3. T. Richardson, "Error-floors of LDPC codes," in Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, pp. 1426-1435, Sept. 2003.
4. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. on Info. Theory, vol. 51, pp. 929-953, March 2005.
5. J. Han and P. Siegel, "Improved upper bounds on stopping redundancy," in Proc. IEEE Int. Symp. Inform. Theory (ISIT'06), (Seattle, Washington), July 2006.
6. P. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," submitted to IEEE Trans. on Inform. Theory, Dec. 2005.
7. M. Schwartz and A. Vardy, "On the stopping distance and stopping redundancy of codes," submitted to IEEE Trans. on Inform. Theory, March 2005.
8. J. Weber and K. Abdel-Ghaffar, "Stopping and dead-end set enumerators for binary Hamming codes," in Proceedings of the Twenty-sixth Symposium on Information Theory in the Benelux, (Brussels, Belgium), pp. 165-172, May 2005.
9. S. Laendner and O. Milenkovic, "Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes," in Proceedings of the International Conference on Wireless Networks, Communications, and Mobile Computing (WirelessComm2005), (Maui, Hawaii), June 2005.
10. I. Kozintsev, "Website, http://www.kozintsev.net/soft.html,"
11. D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. on Inform. Theory, vol. 45, pp. 399-431, March 1999.
12. A. Hedayat, N. Sloane, and J. Stufken, Orthogonal Arrays: Theory and Applications. New York: Springer Verlag, 1999.
13. D. Deng, D. Stinson, and R. Wei, "The Lovász local lemma and its applications to some combinatorial arrays," Designs, Codes and Cryptography, vol. 32, pp. 121-134, May 2004.
14. N. Alon and J. Spencer, "The probabilistic method," in Interscience Series in Discrete Mathematics and Optimization, John Wiley, 2000.
15. P. Carey and A. P. Godbole, "Partial covering arrays and a generalized Erdös-Ko-Rado property," preprint, available at http://arxiv.org/abs/math.CO/0512139, Dec. 2005.