Welcome to the IKCEST

Entropy | Vol.16, Issue.6 | 2017-05-30 | Pages

Entropy

A Novel Block-Based Scheme for Arithmetic Coding

Qi-Bin Hou,Chong Fu  
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.

Original Text (This is the original text for your reference.)

A Novel Block-Based Scheme for Arithmetic Coding

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.

+More

Cite this article
APA

APA

MLA

Chicago

Qi-Bin Hou,Chong Fu,.A Novel Block-Based Scheme for Arithmetic Coding. 16 (6),.

References

Disclaimer: The translated content is provided by third-party translation service providers, and IKCEST shall not assume any responsibility for the accuracy and legality of the content.
Translate engine
Article's language
English
中文
Pусск
Français
Español
العربية
Português
Kikongo
Dutch
kiswahili
هَوُسَ
IsiZulu
Action
Recommended articles

Report

Select your report category*



Reason*



By pressing send, your feedback will be used to improve IKCEST. Your privacy will be protected.

Submit
Cancel