Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets

DOI10.1137/1.9781611973402.134zbMath1423.94174OpenAlexW2399214554MaRDI QIDQ5384096

Xing, Chaoping, Venkatesan Guruswami

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.134

Mathematics Subject Classification ID

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

Related Items (4)

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Nearly optimal robust secret sharing ⋮ List-Decoding with Double Samplers

This page was built for publication: Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets