Binary codes with a minimum distance of four (Corresp.)
M.R. Best · IEEE Transactions on Information Theory · 1980
A new binary code of length ten and minimum Hamming distance four is presented. It contains 40 words and is therefore optimal. It gives rise to a new sphere packing in ten dimensions. Furthermore, it is proved that a binary code of length 11 and minimum distance four cannot contain 80 words.