Efficient universal noiseless source codes
From MaRDI portal
Recommendations
Cited in
(20)- Universal codes for finite sequences of integers drawn from a monotone distribution
- Consistent model selection for the degree corrected stochastic blockmodel
- Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source
- Universal coding for memoryless sources with countably infinite alphabets
- Minimax noiseless universal coding for Markov sources
- Über die implementierung redundanzfreier Codes zur datenverschlüsselung
- A progressive universal noiseless coder
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification
- Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime
- On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
- scientific article; zbMATH DE number 3557667 (Why is no real title available?)
- scientific article; zbMATH DE number 3847300 (Why is no real title available?)
- Predictive analog-to-digital conversion for resistance to data outliers
- A vector quantization approach to universal noiseless coding and quantization
- On a class of multilevel universal source coding schemes
- Universal noiseless coding
- On noiseless source coding with specified encoder output symbol frequencies (Corresp.)
- Universal multiresolution source codes
- On the source matching approach for Markov sources (Corresp.)
This page was built for publication: Efficient universal noiseless source codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3908920)