Minimum distance functions of graded ideals and Reed-Muller-type codes

DOI10.1016/J.JPAA.2016.06.006zbMATH Open1352.13016arXiv1512.06868OpenAlexW2963609083MaRDI QIDQ326562FDOQ326562

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

Publication date: 12 October 2016

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]Hilbert function[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Carvalho%2C+Lopez-Neumann+and+L%EF%BF%BD%EF%BF%BDpez+conjecture&go=Go Carvalho, Lopez-Neumann and L��pez conjecture]graded idealminimum distance functionReed-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) 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?)
• The Geometry of Syzygies
• 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
• Projective nested Cartesian codes
• Affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• Parameterized affine codes
• Cayley-Bacharach Schemes and Their Canonical Modules
• Projective Reed-Muller codes
• The minimum distance of parameterized codes on projective tori
• Reed-Muller codes on complete intersections.
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Degree and algebraic properties of lattice and matrix ideals
• Monomial algebras
• Vanishing ideals over finite fields
• Bounding invariants of fat points using a coding theory construction
• Lower bounds on minimal distance of evaluation codes

Cited In (41)

• Coding theory package for Macaulay2
• Frobenius methods in combinatorics
• Linear codes over signed graphs
• Regularity index of the generalized minimum distance function
• Regularity and projective dimension of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs
• Cummutative algebra and evaluation codes
• Symbolic powers in weighted oriented graphs
• A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
• Depth and regularity of monomial ideals via polarization and combinatorial optimization
• Unmixedness of some weighted oriented graphs
• Rational points of lattice ideals on a toric variety and toric codes
• On parameterized toric codes
• 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
• Equality of ordinary and symbolic powers of edge ideals of weighted oriented graphs
• Calculating the minimum distance of a toric code via algebraic algorithms
• Betti numbers of weighted oriented graphs
• Powers of edge ideals of weighted oriented graphs with linear resolutions
• Relative generalized Hamming weights of evaluation 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
• Minimum distance functions of complete intersections
• Projective dimension and regularity of powers of edge ideals of vertex-weighted rooted forests
• Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
• Minimum distance of relative Reed-Muller codes
• Projective nested Cartesian codes
• Algebraic properties of edge ideals of some vertex-weighted oriented \(m\)-partite graphs
• Hulls of projective Reed-Muller codes over the projective plane
• Footprint and minimum distance functions
• Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs
• The minimum distance of sets of points and the minimum socle degree
• Regularity in weighted oriented graphs
• Toric ideals of weighted oriented graphs
• Edge ideals of oriented graphs
• Vanishing ideals over finite fields
• The \(\text{v} \)-number of monomial ideals
• Algebraic invariants of weighted oriented graphs
• On the De Boer-Pellikaan method for computing minimum distance
• Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

Uses Software

• Macaulay2

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)