|
Problemy Peredachi Informatsii, 2001, Volume 37, Issue 3, Pages 44–54
(Mi ppi526)
|
|
|
|
This article is cited in 11 scientific papers (total in 11 papers)
Source Coding
Improving the Efficiency of the PPM Algorithm
D. A. Shkarin
Abstract:
For the PPM algorithm, we suggest new definitions of generalized frequencies of characters and “escapes.” This considerably increases the efficiency of lossless coding (compression) for various types of real-world discrete data.
Received: 17.10.2000 Revised: 12.03.2001
Citation:
D. A. Shkarin, “Improving the Efficiency of the PPM Algorithm”, Probl. Peredachi Inf., 37:3 (2001), 44–54; Problems Inform. Transmission, 37:3 (2001), 226–235
Linking options:
https://www.mathnet.ru/eng/ppi526 https://www.mathnet.ru/eng/ppi/v37/i3/p44
|
Statistics & downloads: |
Abstract page: | 604 | Full-text PDF : | 296 | References: | 55 | First page: | 2 |
|