Abstract
Suppose the variable x can assume values belonging to a finite set X which consists of N elements. We then say that the “entropy” of the variable x is equal to
Problemy Peredachi Informatsii, 1965, vol. 1, No.1, pages 3–11.
Preview
Unable to display preview. Download preview PDF.
References
V. A. Uspensky, Lectures on computable functions, Moscow, Fizmatgiz, 1960
Kolmogorov, On tables of random numbers, Sankhya. A 25, 4 (1963), 369–376.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shiryayev, A.N. (1993). Three Approaches to the Definition of the Notion of Amount of Information. In: Shiryayev, A.N. (eds) Selected Works of A. N. Kolmogorov. Mathematics and Its Applications, vol 27. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2973-4_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive