2015/06/05 by Dougherty, Steven T., Kim, Jon-Lark, Ozkaya, Buket +2 · 1 citation
#20H30 #94B05 #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1506.01955
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.