Skip to main content

Three Approaches to the Definition of the Notion of Amount of Information

  • Chapter
Book cover Selected Works of A. N. Kolmogorov

Part of the book series: Mathematics and Its Applications ((MASS,volume 27))

  • 1842 Accesses

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

$$H(X) = {\log _2}N$$

Problemy Peredachi Informatsii, 1965, vol. 1, No.1, pages 3–11.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. A. Uspensky, Lectures on computable functions, Moscow, Fizmatgiz, 1960

    Google Scholar 

  2. Kolmogorov, On tables of random numbers, Sankhya. A 25, 4 (1963), 369–376.

    MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

A. N. Shiryayev

Rights and permissions

Reprints 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

Publish with us

Policies and ethics