Abstract
By the methods of differential pulse-code modulation and “generalized” polygonal lines, we obtain almost exact estimates for the ɛ-entropy of classes simulating signals of various types. The complexity of coding and reconstruction of functions from the classes under consideration is investigated. We present a numerical solution of the problem of minimization of constants in the order-of-magnitude inequality for the ɛ-entropy of the classesKH α0
Similar content being viewed by others
References
I. Ya. Tyrygin, “The ɛ-entropy approach to the problem of compression of information,”Ukr. Mat. Zh.,44, No. 11, 1598–1604 (1992).
A. G., Vitushkin,Estimation of Complexity for the Problem of Tabulation [in Russian], Fizmatgiz, Moscow (1959).
A. F. Timan,Theory of Approximations of Functions of real Variable [in Russian], Fizmatgiz, Moscow (1960).
G. G. Lorentz,Approximation of Functions, Holt, New York (1996).
A. N. Kolmogorov and V. M. Tikhomirov, “E-entropy and ɛ-capacity of sets in function spaces,”Usp. Mat. Nauk,14, No. 2, 3–86 (1959).
I. Ya. Tyrygin,An Approach to the Calculation of ɛ-Entropy of the, ɛ-Entropy of the Classes H ɛ0 [in Russian], Preprint 89.72, Institute of Mathematics, Ukrainian Academy of Sciences, Kiev (1989).
I. Ya. Tyrygin,Efficiency of the Method of DPCM and the α-Entropy of the Classes H α0 [in Russian], Preprint 89.75, Institute of Mathematics, Ukrainian Academy of Sciences, Kiev (1989).
A. G. Sukharev, A. V. Timokhov, and V. V. Fedorov,A Course of Optimization Methods [in Russian], Nauka, Moscow, (1986).
Additional information
Institute of Mathematics, Ukrainian Academy of Sciences, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 6, pp. 760–764, June, 1994.
Rights and permissions
About this article
Cite this article
Tyrygin, I.Y. Refined estimates for the ɛ-entropy of the classesKH α0 . Ukr Math J 46, 827–831 (1994). https://doi.org/10.1007/BF02658184
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02658184