Some new bounds on LCD codes over finite fields

04/03/2018
by   Binbin Pang, et al.
0

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n,2) over F_3 and F_4. We study the bound of LCD codes over F_q.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset