DocumentCode :
2491913
Title :
A Fast Implementation of Arithmetic Coding
Author :
Kim, Hyoung Joong
Author_Institution :
Grad. Sch. of Inf. Security & Manage., Korea Univ., Seoul, South Korea
fYear :
2010
fDate :
6-8 April 2010
Firstpage :
419
Lastpage :
423
Abstract :
This paper advances a new lossless data compression method utilizing reversible data hiding to reduce compression times significantly and achieve good compression rates. The core idea of the new approach is to transform a longer binary sequence into a shorter n-ary sequence, transform the n-ary sequence into two binary subsequences, and apply a lossless coding algorithm based on the assumption that a shorter sequence obviously takes less time than a longer sequence. Mathematical conditions to show when the theory proposed in this paper is attainable are provided. The proposed method keeps as good of a compression rate as arithmetic coding, but takes much less time than that. Experiments show that the proposed theory is true.
Keywords :
arithmetic codes; data compression; data encapsulation; encoding; arithmetic coding; lossless coding algorithm; lossless data compression; n-ary sequence; reversible data hiding; Arithmetic; Binary sequences; Conference management; Data compression; Data encapsulation; Encoding; Entropy coding; Histograms; Information management; Information security;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Web Conference (APWEB), 2010 12th International Asia-Pacific
Conference_Location :
Busan
Print_ISBN :
978-1-7695-4012-2
Electronic_ISBN :
978-1-4244-6600-9
Type :
conf
DOI :
10.1109/APWeb.2010.76
Filename :
5474097
Link To Document :
بازگشت