Universal coding algorithm for a family of context Markov sources
From MaRDI portal
Publication:2263012
Recommendations
- Minimax noiseless universal coding for Markov sources
- Universal coding of nonstationary sources
- scientific article; zbMATH DE number 6460053
- Universal coding for discrete memoryless sources uniform with respect to output
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Multi-alphabet universal coding of memoryless sources
- A sequential algorithm for the universal coding of finite memory sources
- Universal decoding for finite-state channels
- Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
- Universal codes for a class of composite sources (Corresp.)
Cites work
- scientific article; zbMATH DE number 4095371 (Why is no real title available?)
- A universal finite memory source
- Aim functions and sequential estimation of the source model for universal coding
- Multialphabet weighted universal coding of context tree sources
- The context-tree weighting method: basic properties
- The performance of universal encoding
Cited in
(6)- Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
- scientific article; zbMATH DE number 1285526 (Why is no real title available?)
- scientific article; zbMATH DE number 3496010 (Why is no real title available?)
- scientific article; zbMATH DE number 6460053 (Why is no real title available?)
- A universal finite memory source
- Symbol-Based Modeling and Coding of Block Markov Sources
This page was built for publication: Universal coding algorithm for a family of context Markov sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263012)
