The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices

@article{Dougherty2017TheCO,
  title={The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices},
  author={Steven T. Dougherty and Jon-Lark Kim and Buket {\"O}zkaya and Lin Sok and Patrick Sol{\'e}},
  journal={IJICoT},
  year={2017},
  volume={4},
  pages={116-128}
}
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. 
Highly Cited
This paper has 45 citations. REVIEW CITATIONS
Tweets
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The theory of error correcting

  • F. J. MacWilliams, N.J.A. Sloane
  • 1981
Highly Influential
12 Excerpts

Bounds on the minimum distance of linear codes and quantum codes

  • M. Grassl
  • Online available at http://www.codetables.de…
  • 2014
Highly Influential
5 Excerpts

Every equidistant linear code is a sequence of dual Hamming codes

  • A. Bonisoli
  • Ars Combinatoria,
  • 1983
Highly Influential
5 Excerpts

The classification of self dual bent functions in eight variables

  • L. Sok Feulner, A. Wassermann P. Solé
  • Designs , Codes , and Cryptography
  • 2013

Solé, classification of extremal and s-extremal binary self-dual codes of length 38

  • C. Aguilar-Melchor, P. Gaborit, J-L. Kim, P. L. Sok
  • IEEE Trans. on Information Theory
  • 2012
2 Excerpts