New Lower Bounds on Binary Constant Weight Error-Correcting Codes

Michael Braun*, Joshua Humpich, Antti Laaksonen, Patric R.J. Östergård

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review


Let A(n,d,w) denote the maximum size of a binary code with length n, minimum distance d and constant weight w. The following lower bounds are here obtained in computer searches for codes with prescribed automorphisms: A(16,4,6) 624, A(19,4,8) 4698, A(20,4,8) 7830, A(21,4,6) 2880, A(22,6,6) 343, A(24,4,5) 1920, A(24,6,9) 3080, A(24,6,11) 5376, A(24,6,12) 5558, A(25,4,5) 2380, A(25,6,10) 6600, A(26,4,5) 2816 and A(27,4,5) 3456.

Original languageEnglish
Pages (from-to)213-223
Number of pages11
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Publication statusPublished - Nov 2019
MoE publication typeA1 Journal article-refereed


Dive into the research topics of 'New Lower Bounds on Binary Constant Weight Error-Correcting Codes'. Together they form a unique fingerprint.

Cite this