Efficient universal noiseless source codes
From MaRDI portal
Publication:3908920
DOI10.1109/TIT.1981.1056355zbMath0458.94030WikidataQ105584069 ScholiaQ105584069MaRDI QIDQ3908920
Mark S. Wallace, Lee D. Davisson, Michael B. Pursley, Robert J. McEliece
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
data compressionminimax redundancyergodic sourcesmemoryless sourcesnonstationary sourcesdiscrete stationary sourcesefficient implementable universal source coding techniquesvariable-rate codes
Related Items
On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels ⋮ Predictive analog-to-digital conversion for resistance to data outliers ⋮ 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
