COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS
DOI10.1142/S0218196713500288zbMath1291.13034arXiv1205.0772MaRDI QIDQ2854966
Rafael H. Villarreal, Hiram H. López-Valdez
Publication date: 24 October 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.0772
complete intersection; toric ideals; evaluation codes; monomial curves; set theoretic complete intersection; lattices ideals
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
14H45: Special algebraic curves and curves of low genus
13P25: Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)
Related Items
Uses Software
Cites Work
- The minimum distance of parameterized codes on projective tori
- Binomial generation of the radical of a lattice ideal
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Linkage and codes on complete intersections
- Cayley-Bacharach and evaluation codes on complete intersections
- Complete intersection lattice ideals
- On the set-theoretic complete intersection problem for monomial curves in \(\mathbb{A}^ n\) and \(\mathbb{P}^ n\)
- Binomial ideals
- The Horace method for error-correcting codes
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- Generators and relations of abelian semigroups and semigroup rings
- On systems of binomials in the ideal of a toric variety
- Set-theoretic complete intersections on binomials
- Sous-monoïdes d'intersection complète de $N$
- Affine semigroup rings that are complete intersections
- Reed-Muller codes on complete intersections.