An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps

DOI10.1109/18.567659zbMath0876.94045OpenAlexW2037397342MaRDI QIDQ4336289

Tom Høholdt, Conny Voss

Publication date: 2 June 1997

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

Full work available at URL: https://doi.org/10.1109/18.567659

zbMATH Keywords

algebraic-geometric codesasymptotically good codes

Mathematics Subject Classification ID

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

Related Items (9)

On evaluation codes coming from a tower of function fields ⋮ An approach to the bases of Riemann-Roch spaces ⋮ The conorm code of an AG-code ⋮ Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields ⋮ A modular interpretation of BBGS towers ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ ON ASYMPTOTICALLY OPTIMAL TOWERS OVER QUADRATIC FIELDS RELATED TO GAUSS HYPERGEOMETRIC FUNCTIONS ⋮ Weierstrass semigroups in an asymptotically good tower of function fields ⋮ Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve

This page was built for publication: An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps