Generic erasure correcting sets: bounds and constructions
From MaRDI portal
Publication:855874
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
Cites work
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- On the stopping distance and the stopping redundancy of codes
Cited in
(3)
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)