Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Classification of Optimal Binary Self-Orthogonal Codes

lliya Bouyukliev1, Stefka Bouyuklieva2, T. Aaron Gulliver3, Patric R. J. Ostergard4
1Institute of Mathematics and Informatics Bulgarian Academy of Sciences P.O. Box 323, 5000 Veliko Tarnovo, Bulgaria
2Department of Mathematics and Informatics Veliko Tarnovo University, 5000 Veliko Tarnovo, Bulgaria
3Department of Electrical & Computer Engineering University of Victoria P.O. Box 3055, STN CSC Victoria, BC, Canada V8W 3P6
4Department of Electrical & Communications Engineering Helsinki University of Technology P.O. Box 3000, 02015 HUT, Finland
  • Published: 30/11/2006

Abstract

In this paper, we complete the classification of optimal binary linear self-orthogonal codes up to length 25. Optimal self-orthogonal codes are also classified for parameters up to length 40 and dimension 10. The results were obtained via two independent computer searches.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
lliya Bouyukliev, Stefka Bouyuklieva, T. Aaron Gulliver, Patric R. J. Ostergard. Classification of Optimal Binary Self-Orthogonal Codes[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 059. 33-87. DOI: .