An Adaptive Homofonic Algorithm
Christian Gehrmann · 2005
Gunther gave an algorithm for homofonic coding of messages for cryptographic purpose which was based on known source statistics. In this paper we give an adaptive homofonic algorithm with short delay for a discrete memoryless source with unknown statistics based on Gunthers algorithm. We give a formula for the individual redundancy as well as a bound for the max redundancy. Finally a comparison with universal source coding and classical ciphers is made.