Generating parity check equations for bounded-distance iterative erasure decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 514-517

  Hollmann, Henk D L ^a   Tolhuizen, Ludo M G M ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Binary erasure channel; Iterative decoding; Stopping set

Indexed keywords

BINARY ERASURE CHANNEL; STOPPING SET;

BINARY CODES; LINEAR EQUATIONS; SET THEORY;

ITERATIVE DECODING;

EID: 33846035057     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261769     Document Type: Conference Paper

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. Th., Vol. 48, No. 6, pp. 1570-1579, June 2002.
2. J.H. Weber and K.A.S. Abdel-Ghaffar, "Stopping Set Analysis for Hamming Codes", Proc. IEEE ITSOC 2005 Information Theory Workshop 2005 on Coding and Complexity (M.J. Dinneen, editor, ISBN 7803-9481-X), Rotorua, New Zealand, pp. 244-247, August 29 - September 1, 2005.
3. M. Schwartz and A. Vardy, "On the Stopping Distance and the Stoppping Redundancy of Codes", Proc. 2005 IEEE Int. Symp. on Information Theory, Adelaide, Australia, pp. 975-979, 4-9 September 2005.
4. M. Schwartz and A. Vardy, "On the Stopping Distance and the Stopping Redundancy of Codes", IEEE Trans. on Inform. Th., Vol. 52, No. 3, March 2006, pp. 922-932.
5. H.D.L. Hollmann and L.M.G.M. Tolhuizen, "On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size", submitted to IEEE Trans. Inform. Th., July 2005. arXiv:cs.IT/0507068.
6. Henk D.L. Hollmann and Ludo M.G.M. Tolhuizen, "Generic erasure correcting sets: bounds and constructions", to appear in Journal of Combinatorial Theory, series A.