An efficient compression scheme supporting partial decoding

Yair Kaufman, Shmuel T. Klein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Summary form only given. A novel compression method that allows the selective decoding of small portions of the compressed file is described. The method constructs a static context tree, which is used to transform the original input into a more compressible form. However, the RCT algorithm is suggested to split the data into pieces, even quite small ones, without too much affecting the compression ratio.

Original languageEnglish
Title of host publicationProceedings - DCC 2003
Subtitle of host publicationData Compression Conference
EditorsJames A. Storer, Martin Cohn
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0769518966
StatePublished - 2003
EventData Compression Conference, DCC 2003 - Snowbird, United States
Duration: 25 Mar 200327 Mar 2003

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


ConferenceData Compression Conference, DCC 2003
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© 2003 IEEE.


  • Arithmetic
  • Computer science
  • Counting circuits
  • Databases
  • Decoding
  • Huffman coding
  • Information retrieval
  • Read-write memory
  • Tail
  • Tree data structures


Dive into the research topics of 'An efficient compression scheme supporting partial decoding'. Together they form a unique fingerprint.

Cite this