Efficient prefix coding of uncertainty spaces

DOI10.1007/BF02367761zbMath0837.94009MaRDI QIDQ1905215

N. N. Diduk

Publication date: 21 May 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

information theoryefficient codingprefix codingShannon-Fano codesuncertainty space

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Partitions and singular transformations of Shannon uncertainty spaces. II

Cites Work

• Unnamed Item
• Uncertainty theory: Purpose, first results, prospects. II
• Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
• Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
• Uncertainty spaces. Entropy and the coding theorem
• Information spaces: Notions of proper information and uncertainty

This page was built for publication: Efficient prefix coding of uncertainty spaces