Further improvements on the Feng-Rao bound for dual codes

DOI10.1016/J.FFA.2014.05.006MaRDI QIDQ405954zbMATH OpenOpenAlexFDO

Authors Olav Geil, Stefano Martin

Publication date 8 September 2014

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

Full work available at URL https://arxiv.org/abs/1305.1091

zbMATH Keywords

minimum distancegeneralized Hamming weightadvisory boundaffine variety codeFeng-Rao boundwell-behaving pair

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Salazar, Dunn and Graham in [Salazar et. al., 2006] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et. al., as well as our improvement are lifted so that they deal with generalized Hamming weights. We also demonstrate the advantage of working with one-way well-behaving pairs rather than weakly well-behaving or well-behaving pairs.

Recommendations

• An improvement of the Feng-Rao bound for primary codes
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Goppa-like bounds for the generalized Feng-Rao distances
• An improvement of the Feng-Rao bound on minimum distance
• Evaluation codes from order domain theory

Cites work

• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 493096 (Why is no real title available?)
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• An improvement of the Feng-Rao bound for primary codes
• An improvement of the Feng-Rao bound on minimum distance
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Decoding affine variety codes using Gröbner bases
• Evaluation codes from order domain theory
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Improved geometric Goppa codes. I. Basic theory
• On the structure of order domains
• Some New Characters on the Wire-Tap Channel of Type II
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes

Cited in

(5)

• From primary to dual affine variety codes over the Klein quartic
• An improvement of the Feng-Rao bound for primary codes
• An improvement of the Feng-Rao bound on minimum distance
• scientific article; zbMATH DE number 750223 (Why is no real title available?)
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Further improvements on the Feng-Rao bound for dual codes

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