A sequence of one-point codes from a tower of function fields

DOI10.1007/S10623-006-9013-XMaRDI QIDQ2383971zbMATH OpenOpenAlexFDO

Authors Takehiro Hasegawa, Shoichi Kondo, Hidekazu Kurusu

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-006-9013-x

zbMATH Keywords

Feng-Rao boundminimum distanceone-point codetower of function fields

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Algebraic functions and function fields in algebraic geometry (14H05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower
• An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
• A note on towers of function fields over finite fields
• On evaluation codes coming from a tower of function fields
• Lower bounds on the minimum distance in Hermitian one-point differential codes

Cites work

• A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
• A note on Hermitian codes over GF(q/sup 2/)
• Algebraic function fields and codes
• Automorphism groups of one-point codes from the curves y/sup q/+y=x/sup qr+1/
• Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• scientific article; zbMATH DE number 1461534 (Why is no real title available?)
• Improvements on parameters of one-point AG codes from Hermitian curves
• On goppa codes and artin—schreier extensions
• On the asymptotic behaviour of some towers of function fields over finite fields
• On the generalized Hamming weights of geometric Goppa codes
• On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
• Remarks on codes from Hermitian curves (Corresp.)
• The minimum distance of codes in an array coming from telescopic semigroups

Cited in

(9)

• On evaluation codes coming from a tower of function fields
• One-point Klein codes and their serial-in-serial-out systematic encoding
• Weierstrass semigroup and codes over the curve \(y^q + y = x^{q^r + 1}\)
• One-Point Codes Using Places of Higher Degree
• The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• Finding the defining functions for one-point algebraic-geometry codes
• On asymptotically optimal towers over quadratic fields related to Gauss hypergeometric functions
• An upper bound for the Garcia-Stichtenoth numbers of towers

This page was built for publication: A sequence of one-point codes from a tower of function fields

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