Efficient List-Decoding With Constant Alphabet and List Sizes

DOI10.1109/TIT.2021.3131992zbMath1495.94148arXiv2011.05884MaRDI QIDQ5080020

Zeyu Guo, Noga Ron-Zewi

Publication date: 30 May 2022

Published in: IEEE Transactions on Information Theory, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

algebraic-geometric codesexplicit constructionserror-correcting codespseudorandomnesslist decodingalgebraic codesalgebraic-geometric (AG) codesblock-triangular-Toeplitz (BTT) matrixcapacity-achieving list decodable codesconstant alphabetconstant list sizesoutput list

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35) Theory of computing (68Qxx)

Related Items (3)

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius

This page was built for publication: Efficient List-Decoding With Constant Alphabet and List Sizes