A family of single-error-correcting codes is described for the protection of binary data words of fixed length

, each of which has the same number

of

\´s. The code family is shown to be valid for all integers

and

(where

. 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

and

.