A novel block-based scheme for arithmetic coding

DOI10.3390/E16063315MaRDI QIDQ296285zbMATH OpenOpenAlexFDO

Authors Qi-Bin Hou, Chong Fu

Publication date 15 June 2016

Published in Entropy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/e16063315

zbMATH Keywords

arithmetic codingblock-based codinginformation entropypartition

Mathematics Subject Classification ID

Source coding (94A29)

Review text

Summary: It is well-known that for a given sequence, its optimal codeword length is fixed. Many coding schemes have been proposed to make the codeword length as close to the optimal value as possible. In this paper, a new block-based coding scheme operating on the subsequences of a source sequence is proposed. It is proved that the optimal codeword lengths of the subsequences are not larger than that of the given sequence. Experimental results using arithmetic coding will be presented.

Recommendations

• Block arithmetic coding for source compression
• An efficient coding system for long source sequences
• Arithmetic coding with folds and unfolds
• scientific article; zbMATH DE number 2036351
• On the average codeword length of optimal binary codes for extended sources (Corresp.)

Cites work

• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• Arithmetic Coding
• Comments on ``Arithmetic coding as a non-linear dynamical system
• Compression of individual sequences via variable-rate coding
• Enumerative source encoding
• Secure Arithmetic Coding
• Statistical mechanics and information-theoretic perspectives on complexity in the Earth system

Describes a project that uses

Uses Software

• JPEG2000

This page was built for publication: A novel block-based scheme for arithmetic coding

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