|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 3, Pages 3–17
(Mi ppi811)
|
|
|
|
This article is cited in 27 scientific papers (total in 27 papers)
Coding Theory
Universal Sequential Coding of Single Messages
Yu. M. Shtar'kov
Abstract:
We define coding redundancy of single messages. A coding method is proposed which ensures a uniform bound on this redundancy for all messages on the output of a source with unknown statistical properties. Using the same criterion, we investigate the possibilities of sequential coding of messages, including messages on the output of a source with unknown statistical properties. Upper bounds on redundancy are obtained for memoryless sources, Markov chains, and various sets of Markov sources.
Received: 26.06.1985
Citation:
Yu. M. Shtar'kov, “Universal Sequential Coding of Single Messages”, Probl. Peredachi Inf., 23:3 (1987), 3–17; Problems Inform. Transmission, 23:3 (1987), 175–186
Linking options:
https://www.mathnet.ru/eng/ppi811 https://www.mathnet.ru/eng/ppi/v23/i3/p3
|
Statistics & downloads: |
Abstract page: | 2539 | Full-text PDF : | 1212 | First page: | 3 |
|