|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 2, Pages 20–35
(Mi ppi271)
|
|
|
|
This article is cited in 12 scientific papers (total in 12 papers)
Information Theory
Multi-Alphabet Universal Coding of Memoryless Sources
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems
Abstract:
The universal coding of memoryless sources is considered in the case where its redundancy depends on the number of different letters in the message to be encoded. The coding method is analyzed and shown to be close to optimal. Some modifications of this method for sequential arithmetic coding are developed and compared with known algorithms.
Received: 05.04.1994
Citation:
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems, “Multi-Alphabet Universal Coding of Memoryless Sources”, Probl. Peredachi Inf., 31:2 (1995), 20–35; Problems Inform. Transmission, 31:2 (1995), 114–127
Linking options:
https://www.mathnet.ru/eng/ppi271 https://www.mathnet.ru/eng/ppi/v31/i2/p20
|
Statistics & downloads: |
Abstract page: | 362 | Full-text PDF : | 171 |
|