Generic erasure correcting sets: bounds and constructions

DOI10.1016/j.jcta.2006.03.024zbMath1106.94024OpenAlexW1977881550MaRDI QIDQ855874

L. M. G. M. Tolhuizen, Henk D. L. Hollmann

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.024

zbMATH Keywords

stopping seterasure decodingbinary erasure channeliterative decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Statistical aspects of information-theoretic topics (62B10) Decoding (94B35)

Cites Work

• Unnamed Item
• On the stopping distance and the stopping redundancy of codes
• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

This page was built for publication: Generic erasure correcting sets: bounds and constructions