This is the authors' abstract. We don't add key points for this paper.
Linear complementary dual (LCD) codes 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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Dougherty et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: