Entropy 2014, 16(6), 3315-3328; doi:10.3390/e16063315
Article

A Novel Block-Based Scheme for Arithmetic Coding

email and * email
Received: 8 February 2014; in revised form: 25 May 2014 / Accepted: 10 June 2014 / Published: 18 June 2014
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: arithmetic coding; block-based coding; partition; information entropy
PDF Full-text Download PDF Full-Text [257 KB, uploaded 18 June 2014 14:11 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

Hou, Q.-B.; Fu, C. A Novel Block-Based Scheme for Arithmetic Coding. Entropy 2014, 16, 3315-3328.

AMA Style

Hou Q-B, Fu C. A Novel Block-Based Scheme for Arithmetic Coding. Entropy. 2014; 16(6):3315-3328.

Chicago/Turabian Style

Hou, Qi-Bin; Fu, Chong. 2014. "A Novel Block-Based Scheme for Arithmetic Coding." Entropy 16, no. 6: 3315-3328.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert