Fast universal coding with context models

DOI10.1109/18.761250MaRDI QIDQ4701359zbMATH OpenOpenAlexFDO

Authors Jorma Rissanen

Publication date 21 November 1999

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

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

zbMATH Keywords

context modelsoptimal model costTree Machineuniversal code

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Implementing the context-tree weighting method: arithmetic coding
• The context-tree weighting method: basic properties
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• scientific article; zbMATH DE number 4127149
• Faster sequential universal coding via block partitioning

Cited in

(5)

• Implementing the context-tree weighting method: arithmetic coding
• Efficient Contextual Unfolding
• Faster sequential universal coding via block partitioning
• Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
• Sequential prediction and ranking in universal context modeling and data compression

This page was built for publication: Fast universal coding with context models

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