On the vanishing ideal of an algebraic toric set and its parametrized linear codes

DOI10.1142/S0219498812500727zbMATH Open1252.13019arXiv1107.4284OpenAlexW2963186008MaRDI QIDQ2909802FDOQ2909802

Rafael H. Villarreal, Eliseo Sarmiento, Maria Vaz Pinto

Publication date: 6 September 2012

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

Abstract: Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex order, of the vanishing ideal I(X) of X. If the clutter is uniform, we classify the complete intersection property of I(X) using linear algebra. We show an upper bound for the minimum distance of certain parameterized linear codes along with certain estimates for the algebraic invariants of I(X).

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

Recommendations

• The minimum distance of parameterized codes on projective tori
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
• Lattice ideals, semigroups and toric codes
• On parameterized toric codes

zbMATH Keywords

linear codescomplete intersectionsdegree complexityvanishing idealsalgebraic invariants

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) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Title not available (Why is that?)
• Hilbert functions of graded algebras
• The Geometry of Syzygies
• Title not available (Why is that?)
• Cayley-Bacharach and evaluation codes on complete intersections
• Projective Reed-Muller codes
• 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
• Binomial ideals
• Combinatorial optimization. Packing and covering
• Toric codes over finite fields
• Relative volumes and minors in monomial subrings.
• The integral closure of subrings associated to graphs
• Rees cones and monomial rings of matroids
• Total dual integrality implies local strong unimodularity

Cited In (10)

• Vanishing ideals over complete multipartite graphs
• The minimum distance of parameterized codes on projective tori
• The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields
• Codes over a weighted torus
• Parameterized codes over some embedded sets and their applications to complete graphs
• Vanishing Ideals Over Graphs and Even Cycles
• Computing the degree of a lattice ideal of dimension one
• Vanishing ideals of parameterized subgroups in a toric variety
• Complete intersection vanishing ideals on degenerate tori over finite fields
• Complete intersection vanishing ideals on sets of clutter type over finite fields

Uses Software

• Macaulay2

This page was built for publication: On the vanishing ideal of an algebraic toric set and its parametrized linear codes

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