Noiseless coding theorem proved by induction for finite stationary memoryless information sources
Information Theory
2014-07-08 v1 math.IT
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.
Cite
@article{arxiv.1407.1477,
title = {Noiseless coding theorem proved by induction for finite stationary memoryless information sources},
author = {Jozsef Szabo},
journal= {arXiv preprint arXiv:1407.1477},
year = {2014}
}