Compressing multisets using tries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Compressing multisets using tries

Résumé

We consider the problem of efficient and lossless representation of a multiset of m words drawn with repetition from a set of size 2^n . One expects that encoding the (unordered) multiset should lead to significant savings in rate as compared to encoding an (ordered) sequence with the same words, since information about the order of words in the sequence corresponds to a permutation. We propose and analyze a practical multiset encoder/decoder based on the trie data structure. The act of encoding requires O(m(n + log m)) operations, and decoding requires O(mn) operations. Of particular interest is the case where cardinality of the multiset scales as m = 2^n/c for some c > 1, as n → ∞. Under this scaling, and when the words in the multiset are drawn independently and uniformly, we show that the proposed encoding leads to an arbitrary improvement in rate over encoding an ordered sequence with the same words. Moreover, the expected length of the proposed codes in this setting is asymptotically within a constant factor of 5/3 of the lower bound.
Fichier non déposé

Dates et versions

hal-01056521 , version 1 (20-08-2014)

Identifiants

Citer

Vincent Gripon, Michael Rabbat, Vitaly Skachek, Warren J. Gross. Compressing multisets using tries. ITW 2012 : IEEE Information Theory Workshop, Sep 2012, Lausanne, Switzerland. pp.642-646, ⟨10.1109/ITW.2012.6404756⟩. ⟨hal-01056521⟩
94 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More