Affine Cartesian codes
algebraic invariantscomplete intersectionsdegreeevaluation codesHilbert functionminimum distanceregularityvanishing ideals
Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
In this paper the affine cartesian codes are introduced. These codes are evaluation codes defined on a cartesian product of finite sets. Let \(X^*\) denote the cartesian product of \(n\) finite subsets \(A_1,\dots,A_n\) of a fixed field \(K\), and fix \(m\) points of \(X^*\), \(P_1,\dots,P_m\). The evaluation of polynomials of \(K[x_1,\dots,x_m]\), with degree less than \(d\), is called affine cartesian code and it is denoted by \(C_{X^*}(d)\). In section 3 the authors investigate the parameters of the code \(C_{X^*}(d)\), in particular in Theorem 3.8 they report a formula for the minimum distance of \(C_{X^*}(d)\). In section 4 the authors consider cartesian codes over degenerated tori. In this case they show an exact formula for the dimension and the minimum distance of such codes.
- A Singular Introduction to Commutative Algebra
- Algebraic function fields and codes
- Algebraic geometric codes. Basic notions
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Cayley-Bacharach and evaluation codes on complete intersections
- Cayley-Bacharach Schemes and Their Canonical Modules
- Combinatorial Nullstellensatz
- Equations over finite fields. An elementary approach
- Evaluation codes over a particular complete intersection
- Hilbert functions of graded algebras
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1559526 (Why is no real title available?)
- Linear codes associated to the ideal of points in PdAnd its canonical module
- Lower bounds on minimal distance of evaluation codes
- Minimum distance of some evaluation codes
- On generalized ReedMuller codes and their relatives
- Projective Reed-Muller codes
- Reed-Muller codes on complete intersections.
- Reed-Muller-type codes over the Segre variety
- Reed‐muller codes: an ideal theory approach
- The minimum distance of parameterized codes on projective tori
- The parameters of projective Reed-Müller codes
- Toric codes over finite fields
- Almost affine 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
- 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
- The dual of an evaluation code
- Coding theory package for Macaulay2
- Batch codes from affine Cartesian codes and quotient spaces
- Relative generalized Hamming weights of affine Cartesian codes
- Evaluation codes and their basic parameters
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Projective nested Cartesian codes
- Affine Cartesian codes with complementary duals
- Computing the degree of a lattice ideal of dimension one
- On the second Hamming weight of some Reed-Muller type codes
- Direct products in projective Segre codes
- Parameterized affine codes
- Binomial vanishing ideals
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Minimum distance of some evaluation codes
- On zeros of a polynomial in a finite grid
- Minimum distance functions of complete intersections
- Regularity and algebraic properties of certain lattice ideals
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Three combinatorial perspectives on minimal codes
- On the Alon-Füredi bound
- On multivariate polynomials with many roots over a finite grid
- A family of codes with variable locality and availability
- Relative generalized Hamming weights of evaluation codes
- On generalized monomial codes defined over sets with a special vanishing ideal
- Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- The error-correcting pair for direct sum codes
- The edge code of hypergraphs
- The weight hierarchy of decreasing norm-trace codes
- Codes parameterized by the edges of a bipartite graph with a perfect matching
- Duals of multiplicity codes
- The Schur product of evaluation codes and its application to CSS-T quantum codes and private information retrieval
- On the next-to-minimal weight of affine Cartesian codes
- High dimensional affine codes whose square has a designed minimum distance
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Generalized Hamming weights and some parameterized codes
This page was built for publication: Affine Cartesian codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439742)
