An improvement of the Feng-Rao bound on minimum distance

DOI10.1016/j.ffa.2003.10.004zbMath1096.94048OpenAlexW1969734869MaRDI QIDQ2500601

Diana Dunn, Sarah B. Graham, Gary Salazar

Publication date: 17 August 2006

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2003.10.004

zbMATH Keywords

linear codeminimum distanceaffine varietyFeng-Rao bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Further improvements on the Feng-Rao bound for dual codes ⋮ On affine variety codes from the Klein quartic ⋮ Improved decoding of affine-variety codes ⋮ An improvement of the Feng-Rao bound for primary codes ⋮ From primary to dual affine variety codes over the Klein quartic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding affine variety codes using Gröbner bases
• On codes from norm-trace curves
• Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
• On the parameters of algebraic-geometry codes related to Arf semigroups
• On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
• ON THE FENG-RAO BOUND FOR THE MINIMUM DISTANCE OF CERTAIN ALGEBRAIC GEOMETRY CODES
• Improved geometric Goppa codes. I. Basic theory

This page was built for publication: An improvement of the Feng-Rao bound on minimum distance