Generalized minimum distance functions

DOI10.1007/S10801-018-0855-XMaRDI QIDQ2011392zbMATH OpenOpenAlexFDO

Authors José Martínez-Bernal, Rafael H. Villarreal, Carlos E. Vivares, Manuel González Sarabia

Publication date 6 December 2019

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hilbert functionhigher weightsReed-Muller type codesfootprint function

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) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a system of homogeneous polynomials has in any given finite set of projective points is expressed as the degree of a graded ideal. If $mathbbX$ is a set of projective points over a finite field and $I$ is its vanishing ideal, we show that the gmd function and the Vasconcelos function of $I$ are equal to the $r$-th generalized Hamming weight of the corresponding Reed-Muller-type code $C_{m}athbbX(d)$ of degree $d$. We show that the generalized footprint function of $I$ is a lower bound for the $r$-th generalized Hamming weight of $C_{m}athbbX(d)$. Then we present some applications to projective nested cartesian codes. To give applications of our lower bound to algebraic coding theory, we show an interesting integer inequality. Then we show an explicit formula and a combinatorial formula for the second generalized Hamming weight of an affine cartesian code.

Recommendations

• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• Footprint and minimum distance functions
• scientific article; zbMATH DE number 7691472
• Minimum distance of linear codes and the -invariant
• Higher weights of affine Grassmann codes and their duals
• On the De Boer-Pellikaan method for computing minimum distance
• Geometric approach to higher weights
• Higher weights and graded rings for binary self-dual codes
• The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics

Cites work

• scientific article; zbMATH DE number 1194481 (Why is no real title available?)
• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• A lower bound on the weight hierarchies of product codes.
• Affine Cartesian codes
• Algebraic geometric codes. Basic notions
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Degree and algebraic properties of lattice and matrix ideals
• Evaluation codes from an affine variety code perspective
• Footprint and minimum distance functions
• Footprints or generalized Bezout's theorem
• Generalized Hamming Weights for Almost Affine Codes
• Generalized Hamming Weights of Irreducible Cyclic Codes
• Generalized Hamming weights and some parameterized codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of affine Cartesian codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Hilbert functions of graded algebras
• Homogeneous polynomials vanishing on the projective space \(\mathbb{P}^m(\mathbb{F}_q)\)
• Minimum distance functions of complete intersections
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Monomial algebras
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• On the generalized Hamming weights of product codes
• On the second Hamming weight of some Reed-Muller type codes
• On the second weight of generalized Reed-Muller codes
• On the structure of order domains
• Projective Reed-Muller codes
• Projective nested Cartesian codes
• Reed-Muller codes on complete intersections.
• Reed-Muller-type codes over the Segre variety
• The parameters of projective Reed-Müller codes
• The second generalized Hamming weight of certain Castle codes
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
• Weighted Reed-Muller codes revisited

Cited in

(23)

• Linear codes over signed graphs
• Minimum distance functions of complete intersections
• Generalized Hamming weights of projective Reed-Muller-type codes over graphs
• Projective nested Cartesian codes
• Relative generalized Hamming weights of affine Cartesian codes
• Relative generalized Hamming weights of evaluation codes
• The dual of an evaluation code
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• Bounds for the minimum distance function
• Regularity index of the generalized minimum distance function
• Footprint and minimum distance functions
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one
• Footprints or generalized Bezout's theorem
• The minimum distance of sets of points and the minimum socle degree
• Projective Reed-Muller type codes on higher dimensional scrolls
• The minimum distance of new generalisations of the punctured binary Reed-Muller codes
• The properties of distance functions over finite fields and their applications in coding theory
• scientific article; zbMATH DE number 7691472 (Why is no real title available?)
• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
• Evaluation codes and their basic parameters
• Saturation and vanishing ideals

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Generalized minimum distance functions

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