Block arithmetic coding for source compression

DOI10.1109/18.259639MaRDI QIDQ4307367zbMATHOpenAlexFDO

Authors Charles G. Jun. Boncelet

Publication date 3 October 1994

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

Full work available at URL https://semanticscholar.org/paper/48f0ca813b8a1473aee92e13b59b12124620ad02

zbMATH Keywords

entropy compressionblock codesarithmetic codesoptimal codervariable to fixed codes

Mathematics Subject Classification ID

Source coding (94A29) Arithmetic codes (94B40)

Recommendations

• An Introduction to Arithmetic Coding
• Fast and efficient coding of information sources
• Publication:4945375
• Efficient method of adaptive arithmetic coding for sources with large alphabets
• A probability-ratio approach to approximate binary arithmetic coding

Cited in

(4)

• Proving divide and conquer complexities in Isabelle/HOL
• Source Coding for Quasiarithmetic Penalties
• A rapid probability estimator and binary arithmetic coder
• A novel block-based scheme for arithmetic coding

This page was built for publication: Block arithmetic coding for source compression

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