A sequence of one-point codes from a tower of function fields
From MaRDI portal
Publication:2383971
DOI10.1007/s10623-006-9013-xzbMath1119.14023OpenAlexW1974835413MaRDI QIDQ2383971
Shoichi Kondo, Hidekazu Kurusu, Takehiro Hasegawa
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
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Algebraic functions and function fields in algebraic geometry (14H05)
Related Items
An upper bound for the Garcia-Stichtenoth numbers of towers ⋮ On evaluation codes coming from a tower of function fields ⋮ Weierstrass semigroup and codes over the curve \(y^q + y = x^{q^r + 1}\) ⋮ ON ASYMPTOTICALLY OPTIMAL TOWERS OVER QUADRATIC FIELDS RELATED TO GAUSS HYPERGEOMETRIC FUNCTIONS
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
- On the asymptotic behaviour of some towers of function fields over finite fields
- Remarks on codes from Hermitian curves (Corresp.)
- A note on Hermitian codes over GF(q/sup 2/)
- On goppa codes and artin—schreier extensions
- Automorphism groups of one-point codes from the curves y/sup q/+y=x/sup qr+1/
- Improvements on parameters of one-point AG codes from Hermitian curves
- Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance
- On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
- On the generalized Hamming weights of geometric Goppa codes
- The minimum distance of codes in an array coming from telescopic semigroups
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
