Considerations and Algorithms for Compression of Sets

We consider compression of unordered sets of distinct elements, focusing particularly on compressing sets of fixed-length bit strings in the presence of statistical information. We address previous work, and outline a novel compression algorithm that allows transparent incorporation of various estimates for probability distribution. Experiments allow the conclusion that set compression can benefit from incorporating statistics, using our method or variants of previously known techniques.