Minimum distance functions of complete intersections
From MaRDI portal
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 by affine hyperplanes, in terms of the regularity of a vanishing ideal.
Recommendations
Cites work
- Affine Cartesian codes
- Algebraic geometric codes. Basic notions
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Bounding invariants of fat points using a coding theory construction
- Cayley-Bacharach and evaluation codes on complete intersections
- Covering the cube by affine hyperplanes
- Equations over finite fields. An elementary approach
- Gröbner Bases, Coding, and Cryptography
- Hilbert functions of graded algebras
- scientific article; zbMATH DE number 52497 (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?)
- scientific article; zbMATH DE number 194422 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Introduction to liaison theory and deficiency modules
- Lectures on results on Bezout's theorem. Notes by D. P. Patil
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Monomial algebras
- On generalized ReedMuller codes and their relatives
- On the Alon-Füredi bound
- On the second Hamming weight of some Reed-Muller type codes
- On the second weight of generalized Reed-Muller codes
- On zeros of a polynomial in a finite grid
- Parameterized affine codes
- Projective Reed-Muller codes
- Reed-Muller codes on complete intersections.
- Reed-Muller-type codes over the Segre variety
- Regularity of lex-segment ideals: Some closed formulas and applications
- SINGULAR
- The minimum distance of parameterized codes on projective tori
- Weighted Reed-Muller codes revisited
Cited in
(19)- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Bounding invariants of fat points using a coding theory construction
- Generalized minimum distance functions
- Coding theory package for Macaulay2
- Steiner systems and configurations of points
- Evaluation codes and their basic parameters
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Footprint and minimum distance functions
- Fat points, partial intersections and Hamming distance
- The properties of distance functions over finite fields and their applications in coding theory
- Bounds for the minimum distance function
- Regularity index of the generalized minimum distance function
- Relative generalized Hamming weights of evaluation codes
- The minimum distance of sets of points and the minimum socle degree
- Generalization of the division algorithm and Gröbner bases
- The edge code of hypergraphs
- Minimum distance of linear codes and the -invariant
- High dimensional affine codes whose square has a designed minimum distance
- Lower bounds on minimal distance of evaluation codes
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)
