Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets

DOI10.1109/TIT.2008.926385MaRDI QIDQ3604743zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Gammerman, B. Ya. Ryabko, Jaakko Astola

Publication date 24 February 2009

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

Full work available at URL https://doi.org/10.1109/tit.2008.926385

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• A note on sequence prediction over large alphabets
• Dynamic-history predictive compression
• An efficient universal prediction algorithm for unknown sources with limited training data
• Efficient method of adaptive arithmetic coding for sources with large alphabets

Cited in

(12)

• Dynamic-history predictive compression
• A note on sequence prediction over large alphabets
• scientific article; zbMATH DE number 49083 (Why is no real title available?)
• An efficient universal prediction algorithm for unknown sources with limited training data
• Predictive rate-distortion for infinite-order Markov processes
• Tunstall adaptive coding and miscoding
• On the MDL principle for i.i.d. sources with large alphabets
• Schemes for Bidirectional Modeling of Discrete Stationary Sources
• Coding for the Large-Alphabet Adversarial Channel
• Large Alphabet Source Coding Using Independent Component Analysis
• Online text prediction with recurrent neural networks
• Time series prediction based on data compression methods

This page was built for publication: Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604743)