Noiseless coding theorem proved by induction for finite stationary memoryless information sources
arXiv:1407.1477
Abstract
Noiseless coding theorem for finite stationary memoryless information sources is proved by using induction on the number of source symbols and the inequality of geometric and harmonic means.