The combinatorics of LCD codes: linear programming bound and orthogonal matrices

From MaRDI portal
Publication:1664083




Abstract: Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings Rk. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters.




Cited in
(80)






This page was built for publication: The combinatorics of LCD codes: linear programming bound and orthogonal matrices

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