Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show tha...
Main Authors: | Jin, Lingfei, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140042 |
Similar Items
-
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
Evaluating the Gilbert-Varshamov bound for constrained systems
by: Goyal, Keshav, et al.
Published: (2024) -
Advances in algebraic geometry codes /
by: Martinez-Moro, Edgar, et al.
Published: (2008) -
Improving the Gilbert-Varshamov bound for $q$-ary codes
by: Van H. Vu, et al.
Published: (2005-01-01) -
Repairing algebraic geometry codes
by: Jin, Lingfei, et al.
Published: (2020)