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...
Saved in:
Main Authors: | Jin, Lingfei, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140042 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vlǎduţ-Zink bounds
by: Xing, C.
Published: (2014) -
Goppa geometric codes achieving the Gilbert-Varshamov bound
by: Xing, C.
Published: (2014) -
Asymptotic bounds on quantum codes from algebraic geometry codes
by: Feng, K., et al.
Published: (2014) -
A generalization of algebraic-geometry codes
by: Xing, C., et al.
Published: (2013) -
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016)