2000 character limit reached
Some new bounds on LCD codes over finite fields
Published 3 Apr 2018 in cs.IT and math.IT | (1804.00799v1)
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 $\mathbb{F}_3$ and $\mathbb{F}_4$. We study the bound of LCD codes over $\mathbb{F}_q$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.