Optimal binary LCD codes (Q2234460)

Let \(\mathbb{F}_q\) be the finite field with \(q\) elements, where \(q\) is a prime power. An \([n,k]_q\) code \(C\) over is said to be LCD code if \(C \cap C^{\perp} = \{ 0 \}\), where \(C^\perp\) denotes the dual code of \(C\). An LCD code is said to be optimal if it has the maximum possible minimum distance w.r.t. its length and dimension. In this paper, the author proves some properties of binary LCD codes related to their shortened and punctured codes. Then, some results about the largest minimum weight of a binary LCD code are presented.