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
-
Evaluating the Gilbert-Varshamov bound for constrained systems
by: Goyal, Keshav, et al.
Published: (2024) -
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
Repairing algebraic geometry codes
by: Jin, Lingfei, et al.
Published: (2020) -
On the Construction of Self-Complementary Codes and their Application in the Problem of Information Hiding
by: Yury V. Kosolapov, et al.
Published: (2022-09-01) -
Algebraic geometry modeling in information theory /
by: Martn̕ez-Moro, Edgar
Published: (2013)