The minimum distance of parameterized codes on projective tori

DOI10.1007/S00200-011-0148-2zbMATH Open1271.13054arXiv1009.4966OpenAlexW2079254998MaRDI QIDQ429761FDOQ429761

Authors: Eliseo Sarmiento, Maria Vaz Pinto, Rafael H. Villarreal 

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus. In this case we determine the minimum distance of any parameterized linear code arising from X.

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

Recommendations

• On the vanishing ideal of an algebraic toric set and its parametrized linear codes
• Projective parameterized linear codes
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Parameterized codes over some embedded sets and their applications to complete graphs
• Minimum distance of some evaluation codes

zbMATH Keywords

regularityminimum distanceHilbert functiondegreeevaluation codescomplete intersectionsparameterized codes

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) Linear codes (general theory) (94B05) Finite ground fields in algebraic geometry (14G15) 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
• The Geometry of Syzygies
• Algebraic geometric codes. Basic notions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic function fields and codes
• Cayley-Bacharach and evaluation codes on complete intersections
• Reed-Muller-type codes over the Segre variety
• Cayley-Bacharach Schemes and Their Canonical Modules
• Title not available (Why is that?)
• Projective Reed-Muller codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 Nullstellensatz
• Equations over finite fields. An elementary approach
• Title not available (Why is that?)
• Lower bounds on minimal distance of evaluation codes
• Linkage and codes on complete intersections
• The Horace method for error-correcting codes
• On the vanishing ideal of an algebraic toric set and its parametrized linear codes
• Reed‐muller codes: an ideal theory approach
• Linear codes associated to the ideal of points in P^dAnd its canonical module
• A note on affine toric varieties

Cited In (30)

• Vanishing ideals over complete multipartite graphs
• Generalized Hamming weights and some parameterized codes
• Direct products in projective Segre codes
• Minimum distance of some evaluation codes
• On parameterized toric codes
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Complete intersections in binomial and lattice ideals
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• On the vanishing ideal of an algebraic toric set and its parametrized linear codes
• Calculating the minimum distance of a toric code via algebraic algorithms
• Regularity and algebraic properties of certain lattice ideals
• Parameterized codes over graphs
• Codes over a weighted torus
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Evaluation codes and their basic parameters
• Minimum distance functions of complete intersections
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
• Parameterized codes over some embedded sets and their applications to complete graphs
• Parameterized codes associated to the edges of some subgraphs of a simple graph
• Vanishing Ideals Over Graphs and Even Cycles
• Affine Cartesian codes
• Computing the degree of a lattice ideal of dimension one
• Complete intersection vanishing ideals on degenerate tori over finite fields
• Complete intersection vanishing ideals on sets of clutter type over finite fields
• Bounding invariants of fat points using a coding theory construction
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
• Joins, ears and Castelnuovo-Mumford regularity
• Regularity of the vanishing ideal over a parallel composition of paths
• Projective parameterized linear codes

This page was built for publication: The minimum distance of parameterized codes on projective tori

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