Generic erasure correcting sets: bounds and constructions

DOI10.1016/J.JCTA.2006.03.024zbMATH Open1106.94024OpenAlexW1977881550MaRDI QIDQ855874FDOQ855874

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

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

Recommendations

• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
• Efficient erasure correcting codes
• List decoding from erasures: bounds and code constructions
• scientific article; zbMATH DE number 2081105
• Linearized decomposition codes and finite integer set coverings

zbMATH Keywords

stopping seterasure decodingbinary erasure channeliterative decoding

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• 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

Cited In (3)

• Erasure-resilient codes from affine spaces
• Linearized decomposition codes and finite integer set coverings
• On Generic Erasure Correcting Sets and Related Problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855874)