Better Binary List Decodable Codes Via Multilevel Concatenation

DOI10.1109/TIT.2008.2008124MaRDI QIDQ4975668zbMATH OpenOpenAlexFDO

Authors Atri Rudra, Venkatesan Guruswami

Publication date 8 August 2017

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

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

Mathematics Subject Classification ID

Decoding (94B35)

Cited in

(7)

• Better Binary List-Decodable Codes Via Multilevel Concatenation
• Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
• List Decoding of Binary Codes–A Brief Survey of Some Recent Results
• Nearly optimal property preserving hashing
• Binary codes for error detection and correction in a computationally bounded world
• Range avoidance for low-depth circuits and connections to pseudorandomness
• Error correcting codes for uncompressed messages

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 Q4975668)