Better than "optimum" homophonic substitution

A perfect homophonic coding technique is devised for which the number of fair coin tosses to select a homophone is bounded for any source with rational letter probabilities. The new scheme enlarges the source alphabet, which paradoxically generally results in less plaintext expansion than does "optimum" homophonic coding of the unaugmented source.