Some new bounds on LCD codes over finite fields (Q2202913)

Let \(\mathbb{F}_q\) be a finite field with \(q\) elements. A linear code \(C\) has complementary dual (or LCD) over \(\mathbb{F}_q\) if \(C\bigoplus{C}^{\perp} = F^n_q\). In this paper, the authors show that LCD codes are not equivalent to non-LCD codes over small finite fields. \(\mathrm{LD}(n, k)\) is defined as the maximum of \(d\) such that there exists an \([n, k, d]\) LCD code over \(\mathbb{F}_q.\) The authors have obtained the value for \(\mathrm{LD}(n,2)\) over \(\mathbb{F}_3.\) Further, the authors generalize a conjecture, by \textit{L. Galvez} et al. [Cryptogr. Commun. 10, No. 4, 719--728 (2018; Zbl 1391.94844)], for any finite field \(\mathbb{F}_q\) which states that, let \(n\) and \(k\) be two positive integers, where \(k>0\), then \(\mathrm{LD}(n + 1, k) \ge \mathrm{LD}(n, k)\).