On the entropy bound for optimum homophonic substitution

A proof is given of the fact that, for optimum binary prefix-free homophonic coding, the entropy of a homophone is less than 2 bits greater than that of its antecedent regardless of the alphabet size for this antecedent.