From run length encoding to LZ78 and back again

Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

6 Citations (Scopus)

Abstract

In this paper, we present efficient algorithms for interconversion between Lempel-Ziv 78 (LZ78) encoding and run length encoding (RLE). We show how, given an RLE of size n for a string S, we can compute the corresponding LZ78 encoding of size m for S in Ο((n + m) log σ) time, where σ is the number of distinct characters appearing in S. We also show how, given an LZ78 encoding of size m for a string S, we can compute the corresponding RLE of size n in Ο(n + m) time. Both algorithms use Ο(m) extra working space.

Original languageEnglish
Title of host publicationProceedings - DCC 2013
Subtitle of host publication2013 Data Compression Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages143-152
Number of pages10
ISBN (Print)9780769549651
DOIs
Publication statusPublished - 2013
Event2013 Data Compression Conference, DCC 2013 - Snowbird, UT, United States
Duration: Mar 20 2013Mar 22 2013

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314

Other

Other2013 Data Compression Conference, DCC 2013
Country/TerritoryUnited States
CitySnowbird, UT
Period3/20/133/22/13

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'From run length encoding to LZ78 and back again'. Together they form a unique fingerprint.

Cite this