On Generic Erasure Correcting Sets and Related Problems

DOI10.1109/TIT.2011.2173729MaRDI QIDQ5272086zbMATH OpenOpenAlexFDO

Authors Harout Aydinian, Rudolf Ahlswede

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2011.2173729

Mathematics Subject Classification ID

Decoding (94B35) Bounds on codes (94B65)

Recommendations

• Generic erasure correcting sets: bounds and constructions
• Error-correcting codes from \(k\)-resolving sets
• On erasure combinatorial batch codes
• On generalizations of the deBruijn-Erdős theorem
• Repetition error correcting sets: explicit constructions and prefixing methods
• Generalized Alon--Boppana Theorems and Error-Correcting Codes
• On Random-Coding Union Bounds With and Without Erasures
• Error-correcting codes based on partial injective maps of finite sets
• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
• On the existence of error-correcting pairs

Cited in

(1)

• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

This page was built for publication: On Generic Erasure Correcting Sets and Related Problems

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