Generic erasure correcting sets: Bounds and constructions

Journal of Combinatorial Theory. Series A

Volumn 113, Issue 8, 2006, Pages 1746-1759

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

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Binary erasure channel; Erasure decoding; Iterative decoding; Stopping set

Indexed keywords

EID: 33748440616     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2006.03.024     Document Type: Article

References (6)

1. Di C., Proietti D., Telatar I.E., Richardson T.J., and Urbanke R.L. Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory 48 6 (June 2002) 1570-1579
2. J.H. Weber, K.A.S. Abdel-Ghaffar, Stopping set analysis for hamming codes, in: M.J. Dinneen (Ed.), Proc. IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, August 29-September 1, ISBN 7803-9481-X, 2005, pp. 244-247
3. M. Schwartz, A. Vardy, On the stopping distance and the stopping redundancy of codes, in: Proc. 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, 4-9 September, 2005, pp. 975-979
4. Schwartz M., and Vardy A. On the stopping distance and the stopping redundancy of codes. IEEE Trans. Inform. Theory 52 3 (March 2006) 922-932
5. H.D.L. Hollmann, L.M.G.M. Tolhuizen, On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size, IEEE Trans. Inform. Theory, submitted for publication, see also arXiv: cs.IT/0507068
6. Alon N., and Spencer J. The Probabilistic Method (1992), Wiley-Interscience, New York