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

From MaRDI portal
Publication:1664083

DOI10.1504/IJICOT.2017.10004700zbMATH Open1406.94089arXiv1506.01955OpenAlexW2963376240MaRDI QIDQ1664083FDOQ1664083

Patrick Solé, Steven T. Dougherty, Buket Özkaya, Lin Sok, Jon-Lark Kim

Publication date: 24 August 2018

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1506.01955






Cited In (72)






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)