Folded codes from function field towers and improved optimal rate list decoding

DOI10.1145/2213977.2214009zbMath1286.94111arXiv1204.4209OpenAlexW2962891889MaRDI QIDQ5415485

Xing, Chaoping, Venkatesan Guruswami

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4209

zbMATH Keywords

pseudorandomnessalgebraic codeslist error-correctionlist decoding capacitysubspace-evasive sets

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (max. 100)

Linear-time list recovery of high-rate expander codes ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Explicit subspace designs ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal rate algebraic list decoding using narrow ray class fields ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Subspace designs based on algebraic function fields ⋮ Unnamed Item ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity

This page was built for publication: Folded codes from function field towers and improved optimal rate list decoding