|
Problemy Peredachi Informatsii, 1981, Volume 17, Issue 3, Pages 20–33
(Mi ppi1405)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
Estimation of Mean Error for a Discrete Successive-Approximation Scheme
V. N. Koshelev
Abstract:
The article investigates coding of discrete memoryless sources by the successive-approximation method. A coding theorem is proved and a generalized Omura bound [IEEE Trans. Inf. Theory, 1973, vol. 19, no. 4, pp. 490–497] is derived for the mean error of the last step of the approximations. The results are applied to a special narrow class of additive approximation schemes. The question of investigating the complexity of the latter is raised.
Received: 25.01.1980
Citation:
V. N. Koshelev, “Estimation of Mean Error for a Discrete Successive-Approximation Scheme”, Probl. Peredachi Inf., 17:3 (1981), 20–33; Problems Inform. Transmission, 17:3 (1981), 161–171
Linking options:
https://www.mathnet.ru/eng/ppi1405 https://www.mathnet.ru/eng/ppi/v17/i3/p20
|
Statistics & downloads: |
Abstract page: | 224 | Full-text PDF : | 88 |
|