A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
DOI10.1109/18.945244zbMATH Open1029.94039OpenAlexW2159193690MaRDI QIDQ4544665FDOQ4544665
Authors: Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, 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
Recommendations
- scientific article; zbMATH DE number 2154096
- Finding the defining functions for one-point algebraic-geometry codes
- Integral bases in a tower of algebraic function fields: a contribution to the construction of asymptotically good algebraic-geometric codes
- A tutorial on AG code construction from a Gröbner basis perspective
- scientific article; zbMATH DE number 1594280
- A sequence of one-point codes from a tower of function fields
- On evaluation codes coming from a tower of function fields
- An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound
- On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound
Gilbert-Varshamov boundconcatenated codeAlgebraic-geometry codefunction field towerone-point AG codespole canceling algorithm
Bounds on codes (94B65) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (29)
- On the \(q\)th power algorithm
- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- On asymptotically optimal towers over quadratic fields related to Gauss hypergeometric functions
- Integral closures and weight functions over finite fields.
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
- Spaces of modular forms and algebraic geometric codes
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- Codes From the Suzuki Function Field
- Bounding the trellis state complexity of algebraic geometric codes
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Integral bases in a tower of algebraic function fields: a contribution to the construction of asymptotically good algebraic-geometric codes
- The root diagram for one-point AG codes arising from certain curves with separated variables
- An optimal unramified tower of function fields
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Explicit towers and codes
- Combinatorial constructions of separating codes
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- Finding the defining functions for one-point algebraic-geometry codes
- Finer-grained reductions in fine-grained hardness of approximation
- Construction-D lattice from Garcia–Stichtenoth tower code
- Outer strong blocking sets
- A class of I.P.P. codes with efficient identification
- Deterministic document exchange protocols and almost optimal binary codes for edit errors
- On rational embeddings of curves in the second Garcia-Stichtenoth tower
This page was built for publication: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544665)
