A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound

DOI10.1109/18.945244zbMath1029.94039OpenAlexW2159193690MaRDI QIDQ4544665

P. Vijay Kumar, Henning Stichtenoth, Kenneth W. Shum, Ilia Aleshnikov, Vinay Deolalikar

Publication date: 4 August 2002

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

Full work available at URL: https://semanticscholar.org/paper/fc007ade14e9f1da3e4e6bacc835bb3f25620fb4

zbMATH Keywords

Gilbert-Varshamov bound concatenated code function field tower Algebraic-geometry code one-point AG codes pole canceling algorithm

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (12)

Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ SPACES OF MODULAR FORMS AND ALGEBRAIC GEOMETRIC CODES ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ On rational embeddings of curves in the second Garcia-Stichtenoth tower ⋮ Efficient Linear and Affine Codes for Correcting Insertions/Deletions ⋮ Integral closures and weight functions over finite fields. ⋮ On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower ⋮ On the \(q\)th power algorithm ⋮ ON ASYMPTOTICALLY OPTIMAL TOWERS OVER QUADRATIC FIELDS RELATED TO GAUSS HYPERGEOMETRIC FUNCTIONS ⋮ Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets ⋮ List decoding codes on Garcia-Stichtenoth tower using Gröbner basis ⋮ A class of I.P.P. codes with efficient identification

This page was built for publication: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound