Affine Cartesian codes

DOI10.1007/s10623-012-9714-2zbMath1312.94118arXiv1202.0085OpenAlexW2095235754MaRDI QIDQ2439742

Rafael H. Villarreal, Hiram H. López-Valdez, Carlos Rentería Márquez

Publication date: 17 March 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

regularitycomplete intersectionsdegreeHilbert functionalgebraic invariantsminimum distanceevaluation codesvanishing ideals

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items

Direct products in projective Segre codes ⋮ Coding theory package for Macaulay2 ⋮ Binomial vanishing ideals ⋮ The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Batch codes from affine Cartesian codes and quotient spaces ⋮ Minimum distance functions of graded ideals and Reed-Muller-type codes ⋮ Projective nested Cartesian codes ⋮ Minimum distance of some evaluation codes ⋮ Relative generalized Hamming weights of affine Cartesian codes ⋮ Affine Cartesian codes with complementary duals ⋮ A family of codes with variable locality and availability ⋮ Generalized Hamming weights and some parameterized codes ⋮ Complete intersection vanishing ideals on sets of clutter type over finite fields ⋮ Relative generalized Hamming weights of evaluation codes ⋮ On generalized monomial codes defined over sets with a special vanishing ideal ⋮ Computing the degree of a lattice ideal of dimension one ⋮ On the second Hamming weight of some Reed-Muller type codes ⋮ Evaluation codes and their basic parameters ⋮ Regularity and algebraic properties of certain lattice ideals ⋮ On Zeros of a Polynomial in a Finite Grid ⋮ Minimum distance functions of complete intersections ⋮ On the Alon-Füredi bound ⋮ On multivariate polynomials with many roots over a finite grid ⋮ Generalized Hamming weights of affine Cartesian codes ⋮ Completing the determination of the next-to-minimal weights of affine cartesian codes ⋮ Generalized minimum distance functions ⋮ Codes over a weighted torus ⋮ Generalized minimum distance functions and algebraic invariants of Geramita ideals ⋮ On the next-to-minimal weight of affine Cartesian codes ⋮ The dual of an evaluation code ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum distance of some evaluation codes
• The minimum distance of parameterized codes on projective tori
• 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
• The parameters of projective Reed-Müller codes
• Equations over finite fields. An elementary approach
• Hilbert functions of graded algebras
• Cayley-Bacharach and evaluation codes on complete intersections
• Reed-Muller-type codes over the Segre variety
• Toric codes over finite fields
• Reed‐muller codes: an ideal theory approach
• Cayley-Bacharach Schemes and Their Canonical Modules
• A Singular Introduction to Commutative Algebra
• Projective Reed-Muller codes
• Combinatorial Nullstellensatz
• 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.