Single-error-correcting codes for constant-weight data words
William H. Kautz, B. Elspas · IEEE Transactions on Information Theory · 1965
A family of single-error-correcting codes is described for the protection of binary data words of fixed lengthk, each of which has the same numberwof1's. The code family is shown to be valid for all integerskandw(where0 < w < k). Some other related codes, based upon conventional Hamming codes, Latin squares, and block designs are also developed, and some of these are more efficient for certain values ofwandk.