Some new bounds on LCD codes over finite fields

From MaRDI portal
Publication:2202913




Abstract: 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 mathbbF3 and mathbbF4. We study the bound of LCD codes over mathbbFq.









This page was built for publication: Some new bounds on LCD codes over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202913)