Noiseless coding theorem proved by induction for finite stationary   memoryless information sources
  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. 
Jozsef Szabo
cs.IT math.IT