Explicit List-decodable codes with optimal rate for computationally bounded channels

DOI10.4230/LIPICS.APPROX-RANDOM.2016.45MaRDI QIDQ4636479zbMATH OpenFDO

Authors Ronen Shaltiel, Jad Silbak

Publication date 19 April 2018

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2016.45

zbMATH Keywords

error correcting codesList decodingpseudorandomness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Explicit list-decodable codes with optimal rate for computationally bounded channels
• Optimal rate code constructions for computationally simple channels
• Explicit capacity-achieving list-decodable codes
• Limits to List Decoding Random Codes
• Combinatorial bounds for list decoding

Cited in

(7)

• Explicit list-decodable codes with optimal rate for computationally bounded channels
• Optimal Rate List Decoding via Derivative Codes
• Optimal rate code constructions for computationally simple channels
• Explicit rateless codes for memoryless binary-input output-symmetric channels
• List-Decoding for the Arbitrarily Varying Channel Under State Constraints
• Folded codes from function field towers and improved optimal rate list decoding
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Explicit List-decodable codes with optimal rate for computationally bounded channels

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