|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 1, Pages 21–34
(Mi ppi357)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Information Theory
Multialphabet Weighting Universal Coding of Context Tree Sources
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems
Abstract:
An algorithm of weighting universal coding of $M$-ary sources $(M\geq 2)$ with contexts of variable length is proposed. The estimates of its basic characteristics are derived. A modification of the algorithm is considered, which allows one to adapt to an unknown number of letters generated in each state.
Received: 25.08.1995
Citation:
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems, “Multialphabet Weighting Universal Coding of Context Tree Sources”, Probl. Peredachi Inf., 33:1 (1997), 21–34; Problems Inform. Transmission, 33:1 (1997), 17–28
Linking options:
https://www.mathnet.ru/eng/ppi357 https://www.mathnet.ru/eng/ppi/v33/i1/p21
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 95 |
|