Generalized minimum distance functions

DOI10.1007/S10801-018-0855-XzbMATH Open1430.13049arXiv1707.03285OpenAlexW2962694285MaRDI QIDQ2011392FDOQ2011392

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)

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.

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

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 \(\alpha\)-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

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)

Cites Work

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

Cited In (23)

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

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)