An improvement of the Feng-Rao bound on minimum distance

DOI10.1016/J.FFA.2003.10.004zbMATH Open1096.94048OpenAlexW1969734869MaRDI QIDQ2500601FDOQ2500601

Authors: Gary Salazar, Diana Dunn, Sarah B. Graham 

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

Recommendations

• Goppa-like bounds for the generalized Feng-Rao distances
• scientific article; zbMATH DE number 3879904
• Goppa-like bounds for the generalized Feng-Rao distances.
• An improvement of the Griesmer bound for some small minimum distances
• ON THE FENG-RAO BOUND FOR THE MINIMUM DISTANCE OF CERTAIN ALGEBRAIC GEOMETRY CODES
• A General Approach to the Optimality of Minimum Distance Estimators
• Improved bounds on Fourier entropy and min-entropy
• Improved Bounds on Fourier Entropy and Min-Entropy
• Further improvements on the Feng-Rao bound for dual codes
• An improvement of the Feng-Rao bound for primary codes

zbMATH Keywords

minimum distancelinear codeaffine varietyFeng-Rao bound

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On codes from norm-trace curves
• Title not available (Why is that?)
• Decoding affine variety codes using Gröbner bases
• Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
• Title not available (Why is that?)
• On the parameters of algebraic-geometry codes related to Arf semigroups
• Improved geometric Goppa codes. I. Basic theory
• 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

Cited In (5)

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

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

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