Generalized minimum distance functions and algebraic invariants of Geramita ideals
From MaRDI portal
Publication:2280053
degreegeneralized minimum distancegeneralized minimum distance function of an idealGeramita idealHilbert functionlinear codes
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: Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function of a graded ideal in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that is non-decreasing as a function of and non-increasing as a function of . For vanishing ideals over finite fields, we show that is strictly decreasing as a function of until it stabilizes. We also study algebraic invariants of Geramita ideals. Those ideals are graded, unmixed, -dimensional and their associated primes are generated by linear forms. We also examine GMD functions of complete intersections and show some special cases of two conjectures of Tohu{a}neanu--Van Tuyl and Eisenbud-Green-Harris.
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
- Cayley-Bacharach Schemes and Their Canonical Modules
- Cayley-Bacharach theorems and conjectures
- Degree and algebraic properties of lattice and matrix ideals
- Footprint and minimum distance functions
- Generalized Hamming weights for linear codes
- Generalized minimum distance functions
- Hilbert functions of graded algebras
- scientific article; zbMATH DE number 3973001 (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 3334305 (Why is no real title available?)
- Minimum distance functions of complete intersections
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Monomial algebras
- On the projective dimension and the unmixed part of three cubics
- On the second Hamming weight of some Reed-Muller type codes
- Projective Reed-Muller codes
- Reed-Muller codes on complete intersections.
- Reed-Muller-type codes over the Segre variety
- Separators of fat points in P^n.
- The dual code of some Reed-Muller type codes
- The Geometry of Syzygies
- The Horace method for error-correcting 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₁ ((q^-1)/N)
- The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q)
Cited in
(35)- Bounding invariants of fat points using a coding theory construction
- The v-number of edge ideals
- Generalized minimum distance functions
- The dual of an evaluation code
- The \(\text{v} \)-number of monomial ideals
- Coding theory package for Macaulay2
- Steiner systems and configurations of points
- Evaluation codes and their basic parameters
- The \(v\)-number and Castelnuovo-Mumford regularity of graphs
- Reed‐muller codes: an ideal theory approach
- scientific article; zbMATH DE number 4010390 (Why is no real title available?)
- Footprints or generalized Bezout's theorem
- Footprint and minimum distance functions
- Minimum distance functions of complete intersections
- Regularity index of the generalized minimum distance function
- Saturation and vanishing ideals
- Commutative algebra methods for coding theory
- Connected domination in graphs and v-numbers of binomial edge ideals
- On the v-number of Gorenstein ideals and Frobenius powers
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- The v-number of binomial edge ideals
- Some results on \(\mathrm{v}\)-number of monomial ideals.
- Geometry of the minimum distance
- Binomial edge ideals of crown graphs
- The v-numbers of Stanley-Reisner ideals from the viewpoint of Alexander dual complexes
- A study of v-number for some monomial ideals
- Simon conjecture and the v-number of monomial ideals
- The v-numbers and linear presentations of ideals of covers of graphs
- On the asymptotic behavior of the vasconcelos invariant for graded modules
- The v-function of powers of sums of ideals
- Asymptotic v-numbers of graded (co)homology modules involving powers of an ideal
- The slope of the \(\operatorname{v}\)-function and the Waldschmidt constant
- On the \(\mathrm{v}\)-number of binomial edge ideals of some classes of graphs
- Title not available (Why is no real title available?)
- Minimum distance of linear codes and the -invariant
This page was built for publication: Generalized minimum distance functions and algebraic invariants of Geramita ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280053)