The authors show that the idea of the successive refinement of interval partitions, which plays the key role in the interval algorithm for random number generation, is also directly applicable to homophonic coding. They propose an efficient and very simple algorithm for homophonic coding which produces an i.i.d. sequence with probability p. The lower and upper bounds for the expected length of the code generated by the algorithm are given. An interval algorithm for fixed-to-variable block homophonic coding which is asymptotically optimal is given. They also give an algorithm for fixed-to-fixed block homophonic coding and show that the decoding error probability tends to zero as the block length tends to infinity. Homophonic coding with cost is also discussed.
展开▼
