|
Problemy Peredachi Informatsii, 1994, Volume 30, Issue 1, Pages 31–50
(Mi ppi219)
|
|
|
|
Information Theory
On the Divisibility of Discrete Sources with an Additive Single-Letter Distortion Measure
V. N. Koshelev
Abstract:
Hierarchical $\varepsilon$-nets for discrete metric spaces as well as hierarchical multilevel codes for discrete memoryless sources are considered. A divisibility problem is formulated. The divisibility means that in each level of the hierarchy, the total amount of the information necessary to pass from an achieved distortion level to a smaller one asymptotically coincides with the corresponding increment of the $\varepsilon$-entropy of the space or the rate-distortion function of the source. Conditions under which a ternary equiprobable source with the balanced distortion measure is divisible are found.
Received: 28.12.1992
Citation:
V. N. Koshelev, “On the Divisibility of Discrete Sources with an Additive Single-Letter Distortion Measure”, Probl. Peredachi Inf., 30:1 (1994), 31–50; Problems Inform. Transmission, 30:1 (1994), 27–43
Linking options:
https://www.mathnet.ru/eng/ppi219 https://www.mathnet.ru/eng/ppi/v30/i1/p31
|
|