CUED Publications database

Two refinements to Shannon's source coding theorem

Kontoyiannis, I (1997) Two refinements to Shannon's source coding theorem. In: UNSPECIFIED 424-..

Full text not available from this repository.

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. © 1997 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Subjects: UNSPECIFIED
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 08 Jan 2018 20:12
Last Modified: 18 Aug 2020 12:42
DOI: 10.1109/ISIT.1997.613361