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.
|Publication status||Published - 2013|
|Event||Data Compression Conference 2013 - The Cliff Lodge Convention Center, Snowbird, Utah, United States|
Duration: 20 Mar 2013 → 22 Mar 2013
Conference number: 23
|Conference||Data Compression Conference 2013|
|Location||The Cliff Lodge Convention Center|
|Period||20/03/2013 → 22/03/2013|