Noiseless coding theorem proved by induction for finite stationary memoryless information sources

Autor:	Szabo, Jozsef
Rok vydání:	2014
Předmět:	Computer Science - Information Theory
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1407.1477 Zobrazit plný text záznamu View this record from Arxiv