Binary codes for locally homogeneous sequences

作     者：Moffat, Alistair Anh, Vo Ngoc 

作者机构：Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：2006年第99卷第5期

页      面：175-180页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：NICTA Victoria Laboratory Australian Research Council, ARC 

主　　题：compression coding Elias code Huffman code minimum-redundancy code locally adaptive code information retrieval algorithms 

摘      要：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.