Title :
Two refinements to Shannon´s source coding theorem
Author :
Kontoyiannis, Ioannis
Author_Institution :
Inf. Syst. Lab., Stanford Univ., CA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
Shannon´s celebrated source coding theorem can be viewed as a “one-sided law of large numbers.” We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided” central limit theorem and a law of the iterated logarithm
Keywords :
Markov processes; entropy; iterative methods; source coding; Markov chains; Shannon´s source coding theorem; codeword lengths; entropy; iterated logarithm law; large numbers one sided law; one-sided central limit theorem; second-order noiseless source coding theorem; Entropy; Information systems; Iterative decoding; Laboratories; Random variables; Source coding; Statistics;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613361
