Minimum distance functions of complete intersections

DOI10.1142/S0219498818502043zbMATH Open1404.13034arXiv1601.07604OpenAlexW2963271418WikidataQ121479261 ScholiaQ121479261MaRDI QIDQ4644375FDOQ4644375

Authors: José Martínez-Bernal, Yuriko Pitones, Rafael H. Villarreal 

Publication date: 4 January 2019

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

Abstract: We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection, we give a formula for the footprint function and a sharp lower bound for the corresponding minimum distance function. This allows us to recover a formula for the minimum distance of an affine cartesian code and the fact that in this case the minimum distance and the footprint functions coincide. Then we present an extension of a result of Alon and F"uredi, about coverings of the cube ${0,1}^n$ by affine hyperplanes, in terms of the regularity of a vanishing ideal.

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

Recommendations

• Generalized minimum distance functions
• Footprint and minimum distance functions
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• Cayley-Bacharach and evaluation codes on complete intersections

zbMATH Keywords

minimum distanceHilbert functiondegreevanishing idealReed-Muller-type code

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) Other types of codes (94B60)

Cites Work

• SINGULAR
• Hilbert functions of graded algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to liaison theory and deficiency modules
• Algebraic geometric codes. Basic notions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the second weight of generalized Reed-Muller codes
• Cayley-Bacharach and evaluation codes on complete intersections
• Reed-Muller-type codes over the Segre variety
• Weighted Reed-Muller codes revisited
• Affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• Parameterized affine codes
• Projective Reed-Muller codes
• Title not available (Why is that?)
• The minimum distance of parameterized codes on projective tori
• On generalized ReedMuller codes and their relatives
• Reed-Muller codes on complete intersections.
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Gröbner Bases, Coding, and Cryptography
• Monomial algebras
• Equations over finite fields. An elementary approach
• Regularity of lex-segment ideals: Some closed formulas and applications
• Bounding invariants of fat points using a coding theory construction
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering the cube by affine hyperplanes
• Lectures on results on Bezout's theorem. Notes by D. P. Patil
• On zeros of a polynomial in a finite grid
• On the Alon-Füredi bound

Cited In (18)

• Coding theory package for Macaulay2
• Regularity index of the generalized minimum distance function
• Generalized minimum distance functions
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Relative generalized Hamming weights of evaluation codes
• Steiner systems and configurations of points
• Evaluation codes and their basic parameters
• Minimum distance of linear codes and the \(\alpha\)-invariant
• Lower bounds on minimal distance of evaluation codes
• Generalization of the division algorithm and Gröbner bases
• Footprint and minimum distance functions
• Bounds for the minimum distance function
• Fat points, partial intersections and Hamming distance
• The minimum distance of sets of points and the minimum socle degree
• High dimensional affine codes whose square has a designed minimum distance
• Bounding invariants of fat points using a coding theory construction
• The properties of distance functions over finite fields and their applications in coding theory

Uses Software

• CoCoA
• SageMath
• SINGULAR

This page was built for publication: Minimum distance functions of complete intersections

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