Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
classification
💻 cs.IT
math.IT
keywords
codesboundalgebraicgeometryasymptoticasymptoticalcodecomplementary
read the original abstract
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is equivalent to an LCD code and consequently there exists a family of LCD codes that are equivalent to algebraic geometry codes and exceed the asymptotical GV bound.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.