scientific article; zbMATH DE number 3623432

From MaRDI portal
Publication:4186205





From the author's introduction: A key feature of Shannon's information theory is the discovery that the colloquial term information can often be given a mathematical meaning as a numerically measurable quantity, on the basis of a probabilistic model, in such a way that the solution of many important problems of information storage and transmission can be formulated in terms of this measure of the amount of information. This information measure has a very concrete operational interpretation: roughly, it equals the minimum number of binary digits needed, on the average, to encode the message in question. The coding theorems of information theory provide so overwhelming evidence for the adequateness of Shannon's information measure that to look for essentially different measures of information might appear to make no sense at all. Moreover, it has been shown by several authors, starting with \textit{C. E. Shannon} [Bell. Syst. Tech. J. 27, 379--423, 623--656 (1948; Zbl 1154.94303)], that the measure of the amount of information is uniquely determined by some rather natural postulates. Still, all the evidence that Shannon's information measure is the only possible one, is valid only within the restricted scope of coding problems considered by Shannon. As \textit{A. Rényi} pointed out in his fundamental paper [Proc. 4th Berkeley Symp. Math. Stat. Probab., Vol. 1, 547--561 (1961; Zbl 0106.33001)] on generalized information measures, in other sorts of problems other quantities may serve, just as well or even better as measures of information. This should be indicated either by their operational significance (pragmatic approach) or by a set of natural postulates characterizing them (axiomatic approach) or, preferably, by both. In this mainly expository paper, some functionals of (complete) probability distributions meeting both criteria will be discussed, with a tendency of giving priority to the operational significance (which, however, need not be connected necessarily with coding). [This article was published in the book announced in Zbl 0396.00010.]




Cited in
(only showing first 100 items - show all)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4186205)