On the stopping distance of finite geometry LDPC codes

IEEE Communications Letters

Volumn 10, Issue 5, 2006, Pages 381-383

  Xia, Shu Tao ^a   Fu, Fang Wei ^b,c  

^a TSINGHUA UNIVERSITY   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c NANKAI UNIVERSITY   (China)

Author keywords

Finite geometry LDPC codes; Iterative decoding; LDPC codes; Stopping distance; Stopping set

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; DECODING; GRAPH THEORY; ITERATIVE METHODS; SET THEORY;

FINITE-GEOMETRY; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; LOWER BOUND; STOPPING DISTANCE; STOPPING SET;

DATA COMMUNICATION SYSTEMS;

EID: 33744457941     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2006.1633330     Document Type: Article

References (6)

1. C. Di, D. Proietti, I. E. Telatar, T. J. 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, pp. 1570-1579, June 2002.
2. N. Kashyap and A. Vardy, "Stopping sets in codes from designs," in Proc. IEEE International Symposium on Information Theory 2003, p. 122.
3. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," in Proc. IEEE International Symposium on Information Theory 2005, pp. 975-979.
4. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
5. H. Tang, J. Xu, S. Lin, and K. A. S. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inform. Theory, vol. 51, pp. 572-596, Feb. 2005.
6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1981 (3rd printing).