A fast implementation of arithmetic coding

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 Jul 9
Event12th International Asia Pacific Web Conference, APWeb 2010 - Busan, Korea, Republic of
Duration: 2010 Apr 62010 Apr 8

Other

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

Fingerprint

Binary sequences
Data compression
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Kim, H. J. (2010). A fast implementation of arithmetic coding. In Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010 (pp. 419-423). [5474097] https://doi.org/10.1109/APWeb.2010.76

A fast implementation of arithmetic coding. / Kim, Hyong Joong.

Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010. 2010. p. 419-423 5474097.

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

Kim, HJ 2010, A fast implementation of arithmetic coding. in Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010., 5474097, pp. 419-423, 12th International Asia Pacific Web Conference, APWeb 2010, Busan, Korea, Republic of, 10/4/6. https://doi.org/10.1109/APWeb.2010.76
Kim HJ. A fast implementation of arithmetic coding. In Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010. 2010. p. 419-423. 5474097 https://doi.org/10.1109/APWeb.2010.76
Kim, Hyong Joong. / A fast implementation of arithmetic coding. Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010. 2010. pp. 419-423
@inproceedings{7db4a9853c794f53aa0ac43c75b8bfe0,
title = "A fast implementation of arithmetic coding",
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.",
author = "Kim, {Hyong Joong}",
year = "2010",
month = "7",
day = "9",
doi = "10.1109/APWeb.2010.76",
language = "English",
isbn = "9780769540122",
pages = "419--423",
booktitle = "Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010",

}

TY - GEN

T1 - A fast implementation of arithmetic coding

AU - Kim, Hyong Joong

PY - 2010/7/9

Y1 - 2010/7/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77954253414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954253414&partnerID=8YFLogxK

U2 - 10.1109/APWeb.2010.76

DO - 10.1109/APWeb.2010.76

M3 - Conference contribution

AN - SCOPUS:77954253414

SN - 9780769540122

SP - 419

EP - 423

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

ER -