Universal modeling and coding

DOI10.1109/TIT.1981.1056282MaRDI QIDQ3905196zbMATH OpenFDO

Authors Jorma Rissanen, Glen G. Jun. Langdon

Publication date 1981

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

zbMATH Keywords

data compression

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Source coding (94A29) Arithmetic codes (94B40)

Cited in

(10)

• Relevant states and memory in Markov chain bootstrapping and simulation
• Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
• Predicting a binary sequence almost as well as the optimal biased coin
• Approximate counting: a detailed analysis
• Lempel-Ziv data compression on parallel and distributed systems
• Inferring decision trees using the minimum description length principle
• A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
• Scalability and communication in parallel low-complexity lossless compression
• Text compression methods
• Entropy estimation of symbol sequences

This page was built for publication: Universal modeling and coding

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