Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound

DOI10.1109/TIT.2017.2773057zbMATH Open1401.94241arXiv1703.01441MaRDI QIDQ4682913FDOQ4682913

Lingfei Jin, Chaoping Xing

Publication date: 19 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (12)

• Hermitian LCD codes from cyclic codes
• On Hermitian LCD codes and their gray image
• Some new bounds on LCD codes over finite fields
• On linear complementary pairs of algebraic geometry codes over finite fields
• A goppa-like bound on the trellis state complexity of algebraic-geometric codes
• Goppa geometric codes achieving the Gilbert-Varshamov bound
• Isometry-Dual Flags of Many-Point AG Codes
• Hulls of linear codes from simplex codes
• BCH codes with larger dimensional hull
• Niederreiter-Rosenbloom-Tsfasman LCD codes
• Constructions of linear codes with small hulls from association schemes
• A new method for constructing linear codes with small hulls

This page was built for publication: Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682913)