English

The formula for the largest minimal distance of binary LCD $[n,2]$ codes

Commutative Algebra 2019-09-04 v1 Combinatorics

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]\mathrm{LCD}[n,k] was defined for binary LCD [n,k][n,k]-codes. We find the formula for LCD[n,2]\mathrm{LCD}[n,2].

Keywords

Cite

@article{arxiv.1909.00253,
  title  = {The formula for the largest minimal distance of binary LCD $[n,2]$ codes},
  author = {Seth Gannon and Hamid Kulosman},
  journal= {arXiv preprint arXiv:1909.00253},
  year   = {2019}
}
R2 v1 2026-06-23T11:02:12.087Z