Better Binary List-Decodable Codes Via Multilevel Concatenation

DOI10.1007/978-3-540-74208-1_40MaRDI QIDQ3603493zbMATH OpenOpenAlexFDO

Authors Atri Rudra, Venkatesan Guruswami

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_40

Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Better Binary List Decodable Codes Via Multilevel Concatenation
• List decoding algorithms for certain concatenated codes
• Improved list-decodability of random linear binary codes
• Improved List-Decodability of Random Linear Binary Codes
• Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• scientific article; zbMATH DE number 1284436
• Iterative list decoding of concatenated source-channel codes
• List Decoding of Binary Codes–A Brief Survey of Some Recent Results
• List-decoding multiplicity codes

Cited in

(3)

• Efficient List Decoding of Explicit Codes with Optimal Redundancy
• List Decoding of Binary Codes–A Brief Survey of Some Recent Results
• A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate

This page was built for publication: Better Binary List-Decodable Codes Via Multilevel Concatenation

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