Affine Cartesian codes with complementary duals

DOI10.1016/J.FFA.2019.01.004zbMATH Open1468.94452arXiv1805.07018OpenAlexW2962791823WikidataQ128425731 ScholiaQ128425731MaRDI QIDQ2422151FDOQ2422151

Authors: Felice Manganiello, Hiram H. López, Gretchen L. Matthews 

Publication date: 18 June 2019

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: A linear code $C$ with the property that $Ccap{C}^{perp}=0$ 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 $m$-dimensional Cartesian set over a finite field $K$ 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.

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

Recommendations

• Linear codes with complementary duals
• New LCD MDS codes constructed from generalized Reed-Solomon codes
• Further results on LCD generalized Gabidulin codes
• LCD codes over finite chain rings

zbMATH Keywords

dual codesevaluation codesextended Euclidean algorithmlinear complementary dual (LCD) codesgeneralized affine Cartesian codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear codes with complementary duals
• The condition for a cyclic code to have a complementary dual
• Complementary dual codes for counter-measures to side-channel attacks
• Algebraic geometric codes. Basic notions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Reed-Muller-type codes over the Segre variety
• Weighted Reed-Muller codes revisited
• Projective nested Cartesian codes
• Affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• Direct products in projective Segre codes
• Projective Reed-Muller codes
• On generalized ReedMuller codes and their relatives
• Combinatorial Nullstellensatz
• Modern computer algebra
• On complementary-dual quasi-cyclic codes
• Decoding affine variety codes using Gröbner bases
• The parameters of projective Reed-Müller codes
• New Constructions of MDS Codes With Complementary Duals
• Title not available (Why is that?)
• Generalized Hamming weights of affine Cartesian codes
• On the next-to-minimal weight of affine Cartesian codes
• Title not available (Why is that?)
• Projective Reed-Muller type codes on rational normal scrolls
• LCD Cyclic Codes Over Finite Fields
• Complementary Dual Algebraic Geometry Codes

Cited In (7)

• Batch codes from affine Cartesian codes and quotient spaces
• On the next-to-minimal weight of affine Cartesian codes
• The dual of an evaluation code
• On generalized monomial codes defined over sets with a special vanishing ideal
• Completing the determination of the next-to-minimal weights of affine cartesian codes
• Parameterized affine codes
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable 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)