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

MaRDI QIDQ6324484zbMATH OpenFDO

Authors Seth Gannon, Hamid Kulosman

Publication date 31 August 2019

Abstract: In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol'e about the linear programming bound for LCD codes the notion $mathrmLCD[n,k]$ was defined for binary LCD $[n,k]$-codes. We find the formula for $mathrmLCD[n,2]$.

This page was built for publication: The formula for the largest minimal distance of binary LCD $[n,2]$ codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324484)