Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound

DOI10.1109/TIT.2019.2930538zbMath1432.94198arXiv1712.10052WikidataQ127492994 ScholiaQ127492994MaRDI QIDQ5211423

Matthew Weidner, Anand Kumar Narayanan

Publication date: 28 January 2020

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

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

zbMATH Keywords

algebraic geometry codesGilbert-Varshamov boundGarcia-Stichtenoth function-field tower

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (1)

Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC

This page was built for publication: Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound