Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes

DOI10.1145/3506668MaRDI QIDQ5066947zbMATH OpenOpenAlexFDO

Authors Chaoping Xing, Venkatesan Guruswami

Publication date 31 March 2022

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

algebraic geometric codeslist decoding capacitypseudorandomnessReed-Solomon codessubspace evasive sets

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets (extended abstract)
• Folded codes from function field towers and improved optimal rate list decoding
• List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
• Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
• Evading subspaces over large fields and explicit list-decodable rank-metric codes

Cites work

• A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• A note on subspace evasive sets
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Algebraic function fields and codes
• Algebraic soft-decision decoding of reed-solomon codes
• Better Binary List Decodable Codes Via Multilevel Concatenation
• Combinatorial Limitations of Average-Radius List-Decoding
• Cyclotomic function fields, Artin-Frobenius automorphisms, and list error correction with optimal rate
• Decoding of Reed Solomon codes beyond the error-correction bound
• Dimension Expanders via Rank Condensers
• Divisibility of the Specialization Map for Families of Elliptic Curves
• Error-correcting codes for list decoding
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
• Explicit subspace designs
• Folded codes from function field towers and improved optimal rate list decoding
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
• List decoding from erasures: bounds and code constructions
• List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
• List-decoding multiplicity codes
• On the asymptotic behaviour of some towers of function fields over finite fields
• Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets (extended abstract)
• Pseudorandomness
• Rational points on curves over finite fields. Theory and Applications
• Subspace designs based on algebraic function fields
• Subspace evasive sets
• The asymptotic behavior of automorphism groups of function fields over finite fields

Cited in

(5)

• Optimal Rate List Decoding via Derivative Codes
• Optimal rate list decoding over bounded alphabets using algebraic-geometric codes
• Construction-D lattice from Garcia–Stichtenoth tower code
• On MSRD codes, h-designs and disjoint maximum scattered linear sets
• Explicit Riemann-Roch spaces in the Hilbert class field

This page was built for publication: Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes

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