Encoding of partially defined discrete memoryless sources
From MaRDI portal
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Recommendations
- Compression of partially defined information
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Noiseless coding theorems corresponding to fuzzy entropies
- A new class of fuzzy coding theorems
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
Cited in
(7)- On weak asymptotic isomorphy of memoryless correlated sources
- A direct proof of the coding theorem for discrete sources with memory
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
- Universal coding for discrete memoryless sources uniform with respect to output
- A measure of underdefined information
- Compression of partially defined information
This page was built for publication: Encoding of partially defined discrete memoryless sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826833)
