464 research outputs found
Quasi-Cyclic Complementary Dual Code
LCD codes are linear codes that intersect with their dual trivially. Quasi
cyclic codes that are LCD are characterized and studied by using their
concatenated structure. Some asymptotic results are derived. Hermitian LCD
codes are introduced to that end and their cyclic subclass is characterized.
Constructions of QCCD codes from codes over larger alphabets are given
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
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
- …