On the generalized Hamming weights of hyperbolic codes

DOI10.1142/S0219498825500628MaRDI QIDQ6580112zbMATH OpenFDO

Authors Eduardo Camps, Ignacio García Marco, Hiram H. López, Irene Márquez-Corbella, E. Martínez-Moro, Eliseo Sarmiento

Publication date 29 July 2024

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219498825500628

zbMATH Keywords

evaluation codesfootprintgeneralized Hamming weightshyperbolic codesReed-Muller codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05)

Review text

The article under review studies the generalized Hamming weights of hyperbolic codes. Hyperbolic codes improve Reed-Muller codes in the sense that they have the same minimum distance and higher dimension. The generalized Hamming weights of a linear code are a generalization of the minimum distance, and they have found several applications since their introduction in [\textit{V. K. Wei}, IEEE Trans. Inf. Theory 37, No. 5, 1412--1418 (1991; Zbl 0735.94008)]. The authors study when a hyperbolic code is also a Reed-Muller code, and they prove that the footprint bound is sharp for hyperbolic codes. This means that one can obtain the generalized Hamming weights of hyperbolic codes by computing the footprint bound. Obtaining the exact value of this bound is still an open problem for hyperbolic codes, but the authors give upper and lower bounds that are sharp in some cases.

Recommendations

• The generalized Hamming weights of some hyperelliptic codes
• Relative generalized Hamming weights of evaluation codes
• Affine variety codes over a hyperelliptic curve
• Explicit computation of generalized Hamming weights for some algebraic geometric codes
• On generalized Hamming weights of some linear codes

Cites work

• A note on the generalized Hamming weights of Reed-Muller codes
• Evaluation codes and their basic parameters
• Evaluation codes from an affine variety code perspective
• Footprints or generalized Bezout's theorem
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of affine Cartesian codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Geometric approach to higher weights
• High dimensional affine codes whose square has a designed minimum distance
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 503203 (Why is no real title available?)
• scientific article; zbMATH DE number 2081133 (Why is no real title available?)
• Improved geometric Goppa codes. I. Basic theory
• On evaluation codes coming from a tower of function fields
• On the second weight of generalized Reed-Muller codes
• Polar Decreasing Monomial-Cartesian Codes

Cited in

(6)

• An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
• The weight hierarchy of decreasing norm-trace codes
• About the generalized Hamming weights of matrix-product codes
• On decoding hyperbolic codes
• Generalized Hamming weights of almost-MDS codes with respect to twisted Reed-Solomon codes
• Cartesian square-free codes

This page was built for publication: On the generalized Hamming weights of hyperbolic codes

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