New single-error-correcting codes
Patric R. J. Östergård, Markku K. Kaikkonen · IEEE Transactions on Information Theory · 1996
A matrix construction of nonlinear error-correcting codes is considered. It is shown how this construction and some related theorems can be applied to old codes to get new codes with minimum distance 3. In total 13 new binary single-error-correcting codes of length at most 511 are obtained.