A Novel Block-Based Scheme for Arithmetic Coding

Entropy

Qi-Bin Hou¹ 

[1] School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; E-Mail

关键词: arithmetic coding;    block-based coding;    partition;    information entropy;   

DOI  :  10.3390/e16063315

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2014 by the authors; licensee MDPI, Basel, Switzerland