Binary codes for locally homogeneous sequences
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. (c) 2006 Elsevier B.V. All rights reserved.
coding compression elias code huffman code minimum-redundancy code locally adaptive code information retrieval algorithms