List decoding from erasures: bounds and code constructions

DOI10.1109/TIT.2003.815776zbMath1301.94156MaRDI QIDQ3546962

Venkatesan Guruswami

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items

Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ The cell probe complexity of succinct data structures ⋮ Linear-time list recovery of high-rate expander codes ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Generalized Hamming weights of three classes of linear codes ⋮ The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes ⋮ Erasures versus errors in local decoding and property testing ⋮ Relative generalized Hamming weights of cyclic codes ⋮ ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Advice Lower Bounds for the Dense Model Theorem ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity