The formula for the largest minimal distance of binary LCD [n,2] codes
classification
🧮 math.AC
math.CO
keywords
codesbinaryformulamathrmbounddefineddistancedougherty
read the original abstract
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol\'e 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]$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.