The formula for the largest minimal distance of binary LCD [n,2] codes
Abstract
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol\'e about the linear programming bound for LCD codes the notion LCD[n,k] was defined for binary LCD [n,k]-codes. We find the formula for LCD[n,2].
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.