Efficient universal noiseless source codes

DOI10.1109/TIT.1981.1056355MaRDI QIDQ3908920zbMATH OpenWikidataFDO

Authors Lee D. Davisson, Michael B. Pursley, Mark S. Wallace, Robert J. McEliece

Publication date 1981

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1981.1056355

zbMATH Keywords

data compressiondiscrete stationary sourcesefficient implementable universal source coding techniquesergodic sourcesmemoryless sourcesminimax redundancynonstationary sourcesvariable-rate codes

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Universal noiseless coding
• Minimax noiseless universal coding for Markov sources
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• Universal variable-to-fixed length source codes
• Universal redundancy rates do not exist

Cited in

(20)

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

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)