The minimum distance of parameterized codes on projective tori

DOI10.1007/s00200-011-0148-2zbMath1271.13054arXiv1009.4966MaRDI QIDQ429761

Rafael H. Villarreal, Maria Vaz Pinto, Eliseo Sarmiento

Publication date: 20 June 2012

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

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

zbMATH Keywords

regularity; complete intersections; degree; Hilbert function; minimum distance; evaluation codes; parameterized codes

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B05: Linear codes (general theory)

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

14G15: Finite ground fields in algebraic geometry

14G50: Applications to coding theory and cryptography of arithmetic geometry

13P25: Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)

Related Items

Minimum distance functions of complete intersections, Vanishing Ideals Over Graphs and Even Cycles, Direct products in projective Segre codes, Minimum distance functions of graded ideals and Reed-Muller-type codes, Complete intersection vanishing ideals on degenerate tori over finite fields, Minimum distance of some evaluation codes, Vanishing ideals over complete multipartite graphs, Regularity and algebraic properties of certain lattice ideals, Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, Parameterized codes associated to the edges of some subgraphs of a simple graph, Generalized Hamming weights and some parameterized codes, The second generalized Hamming weight of some evaluation codes arising from a projective torus, Complete intersection vanishing ideals on sets of clutter type over finite fields, Bounding invariants of fat points using a coding theory construction, Codes over a weighted torus, Joins, ears and Castelnuovo-Mumford regularity, Regularity of the vanishing ideal over a parallel composition of paths, Evaluation codes and their basic parameters, Affine Cartesian codes, Computing the degree of a lattice ideal of dimension one, The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields, COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS, ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Algebraic function fields and codes
• Lower bounds on minimal distance of evaluation codes
• Equations over finite fields. An elementary approach
• Hilbert functions of graded algebras
• Linkage and codes on complete intersections
• A note on affine toric varieties
• Cayley-Bacharach and evaluation codes on complete intersections
• Reed-Muller-type codes over the Segre variety
• Binomial ideals
• 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
• Cayley-Bacharach Schemes and Their Canonical Modules
• Projective Reed-Muller codes
• Combinatorial Nullstellensatz
• The Geometry of Syzygies
• Linear codes associated to the ideal of points in P^dAnd its canonical module
• On generalized ReedMuller codes and their relatives
• Reed-Muller codes on complete intersections.