Single-error-correcting codes for constant-weight data words

A family of single-error-correcting codes is described for the protection of binary data words of fixed length k , each of which has the same number w of 1 's. The code family is shown to be valid for all integers k and w (where 0 . 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 of w and k .