A fast implementation of arithmetic coding

Hyoung Joong Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010
Pages419-423
Number of pages5
DOIs
Publication statusPublished - 2010
Event12th International Asia Pacific Web Conference, APWeb 2010 - Busan, Korea, Republic of
Duration: 2010 Apr 62010 Apr 8

Publication series

NameAdvances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010

Other

Other12th International Asia Pacific Web Conference, APWeb 2010
Country/TerritoryKorea, Republic of
CityBusan
Period10/4/610/4/8

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'A fast implementation of arithmetic coding'. Together they form a unique fingerprint.

Cite this