Jacobsson, M. (1978) Huffman coding in bit-vector compression. Information Processing Letters 7: 308--311. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Storing And Retrieving Keys In A Table By Cross-Indexing - Teahan, Witten (Correct)
....list of fixed sized integers for each 1 bit in the bitmap contains NK values, and consumes S = NK log (NKA) bits. Many methods for compressing sparse sets are based on lists, including run length coding (Klein et al. 1989) Huffman coding (Moffat Zobel, 1992) and a combination of the two (Jacobsson, 1978; Fraenkel Klein, 1985) 3.3. B BLOCK CODING A recently developed technique is to represent a difference list of n items between 1 and N by encoding each difference in two parts a unary part followed by a binary part (Moffat Zobel, 1992) The former is represented by a consecutive run of ....
Jacobsson, M. (1978) Huffman coding in bit-vector compression. Information Processing Letters 7: 308--311.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC