Minimum distance functions of graded ideals and Reed-Muller-type codes
From MaRDI portal
(Redirected from Publication:326562)
Hilbert functiongraded idealminimum distance functionReed-Muller-type codeGröbner basesCarvalho, Lopez-Neumann and López conjecture
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: We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives an algebraic formulation of the minimum distance of a projective Reed-Muller-type code in terms of the algebraic invariants and structure of the underlying vanishing ideal. Then we give a method, based on Groebner bases and Hilbert functions, to find lower bounds for the minimum distance of certain Reed-Muller-type codes. Finally we show explicit upper bounds for the number of zeros of polynomials in a projective nested cartesian set and give some support to a conjecture of Carvalho, Lopez-Neumann and Lopez.
Recommendations
- Minimum distance of relative Reed-Muller codes
- On the minimal distance of a polynomial code
- Minimum distance of symplectic Grassmann codes
- The minimum distance of new generalisations of the punctured binary Reed-Muller codes
- scientific article; zbMATH DE number 1441986
- On the minimum distances of Schubert codes
- Minimum distance bounds for \(s\)-regular codes
- Minimal codewords in Reed-Muller codes
- Minimum distance of orthogonal line-Grassmann codes in even characteristic
- Minimum distance of linear codes and the \(\alpha\)-invariant
Cites work
- 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?)
- 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 Schemes and Their Canonical Modules
- Cayley-Bacharach and evaluation codes on complete intersections
- Degree and algebraic properties of lattice and matrix ideals
- Hilbert functions of graded algebras
- Lower bounds on minimal distance of evaluation codes
- Monomial algebras
- On the second Hamming weight of some Reed-Muller type codes
- On the second weight of generalized Reed-Muller codes
- Parameterized affine codes
- Projective Reed-Muller codes
- Projective nested Cartesian codes
- Reed-Muller codes on complete intersections.
- Reed-Muller-type codes over the Segre variety
- The Geometry of Syzygies
- The minimum distance of parameterized codes on projective tori
- Vanishing ideals over finite fields
- Weighted Reed-Muller codes revisited
Cited in
(42)- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Linear codes over signed graphs
- Minimum distance functions of complete intersections
- Equality of ordinary and symbolic powers of edge ideals of weighted oriented graphs
- Projective nested Cartesian codes
- Depth and regularity of monomial ideals via polarization and combinatorial optimization
- Projective dimension and regularity of powers of edge ideals of vertex-weighted rooted forests
- On parameterized toric codes
- Cummutative algebra and evaluation codes
- Symbolic powers in weighted oriented graphs
- Unmixedness of some weighted oriented graphs
- Relative generalized Hamming weights of evaluation codes
- On the De Boer-Pellikaan method for computing minimum distance
- Algebraic invariants of weighted oriented graphs
- Hulls of projective Reed-Muller codes over the projective plane
- Algebraic properties of edge ideals of some vertex-weighted oriented \(m\)-partite graphs
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
- Betti numbers of weighted oriented graphs
- Edge ideals of oriented graphs
- Regularity index of the generalized minimum distance function
- The \(\text{v} \)-number of monomial ideals
- Symbolic powers of monomial ideals and Cohen-Macaulay vertex-weighted digraphs
- Regularity and projective dimension of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs
- Footprint and minimum distance functions
- Toric ideals of weighted oriented graphs
- Calculating the minimum distance of a toric code via algebraic algorithms
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Frobenius methods in combinatorics
- The minimum distance of sets of points and the minimum socle degree
- Rational points of lattice ideals on a toric variety and toric codes
- Coding theory package for Macaulay2
- Vanishing ideals over finite fields
- Minimum distance of relative Reed-Muller codes
- Regularity in weighted oriented graphs
- Commutative algebra methods for coding theory
- Generalized minimum distance functions
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- Monomial ideals of weighted oriented graphs
- Projective dimension and regularity of edge ideals of some weighted oriented graphs
- Evaluation codes and their basic parameters
- Powers of edge ideals of weighted oriented graphs with linear resolutions
- Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes
This page was built for publication: Minimum distance functions of graded ideals and Reed-Muller-type codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326562)
