TY - JOUR
T1 - New Lower Bounds on Binary Constant Weight Error-Correcting Codes
AU - Braun, Michael
AU - Humpich, Joshua
AU - Laaksonen, Antti
AU - Östergård, Patric R.J.
N1 - tarkista DOI
PY - 2019/11
Y1 - 2019/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85096365148&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85096365148
SN - 0835-3026
VL - 111
SP - 213
EP - 223
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -