Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
The author's basic coding theorem for discrete uncertainty spaces is so far the central result of the developing uncertainty theory. The theorem was first published in [\textit{N. N. Diduk}, Dokl. Akad. Nauk UkrSSR, Ser. A 1, 63-65 (1983)]\ and its proof in [\textit{N. N. Diduk}, Kibernetika 2, 69-73 (1984)]. A refinement of the basic coding theorem with a new proof was subsequently published. The author considers practical aspects of the basic coding theorem. The basis for the application of the theorem is its semantics, i.e., the system of possible meaningful interpretations. The present paper examines examples of particular cases of the basic coding theorem which admit a probabilistic interpretation; see also [ibid. 29, No. 4, 606-612 (1993; Zbl 0812.60002)].
- Uncertainty spaces. Entropy and the coding theorem
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Information spaces: Notions of proper information and uncertainty
- Efficient prefix coding of uncertainty spaces
- A fixed-length source coding theorem on quasi-probability space
- scientific article; zbMATH DE number 3807501 (Why is no real title available?)
- Information spaces: Notions of proper information and uncertainty
- Information-theoretical comparison of fuzziness and probabilistic uncertainty. I
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Uncertainty spaces. Entropy and the coding theorem
- Uncertainty theory: Purpose, first results, and prospects. I
- Uncertainty theory: Purpose, first results, prospects. II
This page was built for publication: Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905183)
