Coding of sources with unknown statistics--I: Probability of encoding error
J Ziv - IEEE Transactions on Information Theory, 1972 - ieeexplore.ieee.org
It is well known that it is often possible to obtain considerable data compression by encoding
messages in long blocks. Usually the coding scheme for a specific source depends
parametrically on the statistics of the source. Universal codes which are independent of the
source statistics are introduced. These codes are shown to be asymptotically optimal in the
sense that the probability of encoding error can be made vanishingly small for output rates
no larger than those of optimal codes that do in fact depend on the statistics of the source. A …
messages in long blocks. Usually the coding scheme for a specific source depends
parametrically on the statistics of the source. Universal codes which are independent of the
source statistics are introduced. These codes are shown to be asymptotically optimal in the
sense that the probability of encoding error can be made vanishingly small for output rates
no larger than those of optimal codes that do in fact depend on the statistics of the source. A …
Showing the best result for this search. See all results
