|
Problemy Peredachi Informatsii, 1992, Volume 28, Issue 3, Pages 95–111
(Mi ppi1361)
|
|
|
|
Information Theory and Coding Theory
Switching Discrete Sources and Their Universal Encoding
Yu. M. Shtar'kov
Abstract:
We consider a model of switching discrete source and its relationship to a model of a source with a finite number of states. For some sets of switching sources, we derive upper bounds on the redundancy of universal coding by the maximum probability method. The redundancy bounds are refined for various sets of sources with a finite number of states. For these sources, the bounds can be achieved by sequential coding with polynomial (in block length) complexit
Received: 17.06.1991 Revised: 29.01.1992
Citation:
Yu. M. Shtar'kov, “Switching Discrete Sources and Their Universal Encoding”, Probl. Peredachi Inf., 28:3 (1992), 95–111; Problems Inform. Transmission, 28:3 (1992), 282–296
Linking options:
https://www.mathnet.ru/eng/ppi1361 https://www.mathnet.ru/eng/ppi/v28/i3/p95
|
|