Affine Cartesian codes with complementary duals
From MaRDI portal
Publication:2422151
Abstract: A linear code with the property that is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed-Solomon codes arise as duals of Reed-Solomon codes. Generalized affine Cartesian codes are evaluation codes constructed by evaluating multivariate polynomials of bounded degree at points in -dimensional Cartesian set over a finite field and scaling the coordinates. The LCD property depends on the scalars used. Because Reed-Solomon codes are a special case, we obtain a characterization of those generalized Reed-Solomon codes which are LCD along with the more general result for generalized affine Cartesian codes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (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 1565322 (Why is no real title available?)
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- scientific article; zbMATH DE number 6765484 (Why is no real title available?)
- Affine Cartesian codes
- Algebraic geometric codes. Basic notions
- Combinatorial Nullstellensatz
- Complementary Dual Algebraic Geometry Codes
- Complementary dual codes for counter-measures to side-channel attacks
- Decoding affine variety codes using Gröbner bases
- Direct products in projective Segre codes
- Fundamentals of Error-Correcting Codes
- Generalized Hamming weights of affine Cartesian codes
- LCD Cyclic Codes Over Finite Fields
- Linear codes with complementary duals
- Modern computer algebra
- New Constructions of MDS Codes With Complementary Duals
- On complementary-dual quasi-cyclic codes
- On generalized ReedMuller codes and their relatives
- On the next-to-minimal weight of affine Cartesian codes
- On the second Hamming weight of some Reed-Muller type codes
- Projective Reed-Muller codes
- Projective Reed-Muller type codes on rational normal scrolls
- Projective nested Cartesian codes
- Reed-Muller-type codes over the Segre variety
- The condition for a cyclic code to have a complementary dual
- The parameters of projective Reed-Müller codes
- Weighted Reed-Muller codes revisited
Cited in
(7)- The dual of an evaluation code
- Parameterized affine codes
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- On generalized monomial codes defined over sets with a special vanishing ideal
- On the next-to-minimal weight of affine Cartesian codes
- Batch codes from affine Cartesian codes and quotient spaces
- Completing the determination of the next-to-minimal weights of affine cartesian codes
This page was built for publication: Affine Cartesian codes with complementary duals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422151)