A fixed-length source coding theorem on quasi-probability space
From MaRDI portal
Publication:4977947
DOI10.1007/978-3-319-19105-8_29zbMATH Open1368.94070OpenAlexW2417848575MaRDI QIDQ4977947FDOQ4977947
Authors: Yang Yang, Lin-Qing Gao, Chao Wang, Ming-Hu Ha
Publication date: 17 August 2017
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19105-8_29
Recommendations
Cites Work
- Elements of Information Theory
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Values of Non-Atomic Games
- Title not available (Why is that?)
- Generalized information theory
- Theory of capacities
- Source coding with escort distributions and Rényi entropy bounds
- An axiomatic derivation of the coding-theoretic possibilistic entropy
- Possibilistic information theory: A coding theoretic approach
- On Compression of Data Encrypted With Block Ciphers
- Information entropy of a discrete information source with \(g_\lambda\) distribution and its application
Cited In (5)
- Stationary quantum source coding
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Examples of probabilistic semantics of the basic coding theorem for uncertainty spaces
- Almost-sure variable-length source coding theorems for general sources
- Source Coding for Quasiarithmetic Penalties
This page was built for publication: A fixed-length source coding theorem on quasi-probability space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977947)