Considerations and Algorithms for Compression of Sets

Jesper Larsson

Research output: Contribution to conference - NOT published in proceeding or journalPosterResearchpeer-review

Abstract

We consider compression of unordered sets of distinct elements. After a discus- sion of the general problem, we focus on compressing sets of fixed-length bitstrings in the presence of statistical information. We survey techniques from previous work, suggesting some adjustments, and propose a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Our experimental results allow the conclusion that set compression can benefit from incorporat- ing statistics, using our method or variants of previously known techniques.
Original languageEnglish
Publication date2013
DOIs
Publication statusPublished - 2013
EventData Compression Conference 2013 - The Cliff Lodge Convention Center, Snowbird, Utah, United States
Duration: 20 Mar 201322 Mar 2013
Conference number: 23
http://www.cs.brandeis.edu/~dcc/

Conference

ConferenceData Compression Conference 2013
Number23
LocationThe Cliff Lodge Convention Center
Country/TerritoryUnited States
CitySnowbird, Utah
Period20/03/201322/03/2013
Internet address

Keywords

  • Set compression
  • Bitstring compression
  • Probability distribution incorporation
  • Statistical information
  • Compression algorithms

Fingerprint

Dive into the research topics of 'Considerations and Algorithms for Compression of Sets'. Together they form a unique fingerprint.

Cite this