arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.6410cs.ITmath.ITstat.AP
收藏

序列的压缩集与多集

Compressing Sets and Multisets of Sequences

Christian Steinruecken

摘要:

本文描述了多序列集的无损压缩算法,利用了多序列集的无序结构。多集是一个集合的推广,其中成员可以出现多次。一个多集可以简单地通过以某种顺序存储它的元素来编码,但是这样的话信息就浪费在排序上了。我们提出了一种技术,转换成一个顺序不变的树表示的多重集,并推导出一个算术代码,最佳压缩树。我们的方法实现了压缩,即使在多集中的序列是单独不可压缩的(如加密哈希和)。该算法实际上是通过压缩SHA-1哈希和的集合以及任意的、可单独编码的对象的多集合来证明的。

英文摘要:

This article describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalisation of sets where members are allowed to occur multiple times. A multiset can be encoded naïvely by simply storing its elements in some sequential order, but then information is wasted on the ordering. We propose a technique that transforms the multiset into an order-invariant tree representation, and derive an arithmetic code that optimally compresses the tree. Our method achieves compression even if the sequences in the multiset are individually incompressible (such as cryptographic hash sums). The algorithm is demonstrated practically by compressing collections of SHA-1 hash sums, and multisets of arbitrary, individually encodable objects.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑