Explicit capacity-achieving list-decodable codes

DOI10.1145/1132516.1132518MaRDI QIDQ2931364zbMATH OpenOpenAlexFDO

Authors Atri Rudra, Venkatesan Guruswami

Publication date 25 November 2014

Published in Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1132516.1132518

zbMATH Keywords

Reed-Solomon codesalgebraic decodinglist decodingchannel capacityZyablov bound

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Combinatorial bounds for list decoding
• Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
• Two theorems on list decoding (extended abstract)
• Improved decoding of Reed-Solomon and algebraic-geometry codes

Cited in

(13)

• Explicit List-decodable codes with optimal rate for computationally bounded channels
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• List Decoding of Binary Codes–A Brief Survey of Some Recent Results
• Collision resistance from multi-collision resistance for all constant parameters
• Improvements on the Johnson bound for Reed-Solomon codes
• Explicit list-decodable codes with optimal rate for computationally bounded channels
• List-decoding multiplicity codes
• On the error-correcting radius of folded Reed-Solomon code designs
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
• Evading subspaces over large fields and explicit list-decodable rank-metric codes
• Efficient List Decoding of Explicit Codes with Optimal Redundancy
• List-decoding Barnes-Wall lattices

This page was built for publication: Explicit capacity-achieving list-decodable codes

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