It is shown that the fraction

of ones in the

positions of

distinct binary

-tuples satisfies the inequality begin{equation} h(p) geq (l/n) log_2 M end{equation} where

is the binary entropy function. This inequality, which simplifies the derivation of the distance property of the Justesen codes, is proved using an elegant information-theoretic argument due to Kriz.