Title :
Second-order noiseless source coding theorems
Author :
Kontoyiannis, I.
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
fDate :
7/1/1997 12:00:00 AM
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; source coding; Markov chains; Shannon source coding theorem; codeword lengths; entropy; iterated logarithm; large numbers; one-sided central limit theorem; one-sided law; second-order noiseless source coding theorems; Codes; Convergence; Entropy; Equations; Information systems; Source coding;
Journal_Title :
Information Theory, IEEE Transactions on
