The formula for the largest minimal distance of binary LCD $[n,2]$ codes
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Solé about the linear programming bound for LCD codes the notion $\mathrm{LCD}[n,k]$ was defined for binary LCD $[n,k]$-codes. We find the formula for $\mathrm{LCD}[n,2]$.
math.AC↗