New Lower Bounds on Binary Constant Weight Error-Correcting Codes

Abstract

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)\ge 624$, $A(19,4,8)\ge 4698$, $A(20,4,8)\ge 7830$, $A(21,4,6)\ge 2880$, $A(22,6,6)\ge 343$, $A(24,4,5)\ge 1920$, $A(24,6,9)\ge 3080$, $A(24,6,11)\ge 5376$, $A(24,6,12)\ge 5558$, $A(25,4,5)\ge 2380$, $A(25,6,10)\ge 6600$, $A(26,4,5)\ge 2816$, and $A(27,4,5)\ge 3456$.