Stopping sets in codes from designs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 122-

  Kashyap, Navin ^a   Vardy, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; DECODING; ENCODING (SYMBOLS); GEOMETRY; ITERATIVE METHODS; SET THEORY;

EUCLIDEAN GEOMETRY; ITERATIVE DECODING; MAXIMUM LIKELIHOOD DECODING; PROJECTIVE GEOMETRY; STOPPING SETS;

CODES (SYMBOLS);

EID: 0141973785     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228136     Document Type: Conference Paper

References (3)

1. Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-density parity check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2735, Nov. 2001.
2. 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 2000.
3. J.H. van Lint and R.M. Wilson, A Course in Combinatorics, 2-nd edition, Cambridge University Press, 2001.