Elsevier

Information Processing Letters

Volume 99, Issue 5, 15 September 2006, Pages 175-180
Information Processing Letters

Binary codes for locally homogeneous sequences

https://doi.org/10.1016/j.ipl.2006.04.014Get rights and content

Abstract

Static codes for the non-negative integers have a range of applications, including in the storage of inverted indexes, and in dictionary-based compression systems. We present two simple codes based on binary representations that are suited for message sequences in which the values are locally homogeneous, but not globally consistent. Experimental results based on typical sequences are given to show the efficacy of the new methods.

References (11)

  • J. Teuhola

    A compression method for clustered bit-vectors

    Information Processing Letters

    (1978)
  • V.N. Anh et al.

    Inverted index compression using word-aligned binary codes

    Information Retrieval

    (2005)
  • R. Baeza-Yates et al.

    Modern Information Retrieval

    (1999)
  • P. Elias

    Universal codeword sets and representations of the integers

    IEEE Transactions on Information Theory

    (1975)
  • P. Fenwick

    The Burrows–Wheeler transform for block sorting text compression: Principles and improvements

    The Computer Journal

    (1996)
There are more references available in the full text version of this article.

Cited by (8)

View all citing articles on Scopus

The approach described in Section 2 was presented in preliminary form at the 2005 IEEE Data Compression Conference, March 29–31, 2005, Snowbird, Utah.

1

This author was supported by the Australian Research Council, the ARC Special Research Center for Perceptive and Intelligent Machines in Complex Environments, and the NICTA Victoria Laboratory.

2

This author was supported by the ARC Special Research Center for Perceptive and Intelligent Machines in Complex Environments.

View full text