期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一组整数的几个实用编码方案

Several practical coding schemes for a block of integers
在线阅读 下载PDF
导出
摘要 以Golomb码和扩展Gamma码为基础提出了4种针对一组整数的编码方案。这些方案增强了对低熵值整数序列的压缩性能,同时仍保持了整数码低复杂性的特点。通过应用这些编码方案,设计了一个基于Burrows-Wheeler变换的压缩算法。该算法的实验结果表明其压缩比率要优于采用整数码的BWT类压缩算法。 Four coding schemes for a block of integers were proposed based on Golomb codes and extended Gamma codes. These schemes enhanced the compression performance on integer sequences with low entropy and still enjoy the simplicity of integer codes. By applying these coding schemes, a compression algorithm based on Burrows-Wheeler transform was designed. Experimental results of this algorithm indicate lossless coding rates better than those achieved by BWT-based compression algorithms using integer codes.
作者 杨胜天 仇佩亮
机构地区 浙江大学信息与电子工程学系
出处 《通信学报》 EI CSCD 北大核心 2005年第7期1-7,共7页 Journal on Communications
关键词 信息论 通用数据压缩 整数编码:Golomb码 扩展Gamma码 Burrows-Wheeler变换 information theory universal data compression integer coding Golomb codes extended Gamma codes Burrows Wheeler transform
分类号 TN911.21 [电子电信—通信与信息系统]
  • 相关文献

参考文献29

  • 1GOLOMB S W. Run-length encodings[J]. IEEE Trans Inform Theory,1966, 12(3): 399-401.
  • 2ELIAS P. Universal codeword sets and representations of the integers[J]. IEEE Trans Inform Theory, 1975, 21(2): 194-203.
  • 3EVEN S, RODEH M. Economical encoding of commas between strings [J]. Commun ACM, 1978, 21(4): 315-317.
  • 4STOUT Q F. Improved prefix encoding of the natural numbers[J].IEEE Trans Inform Theory, 1980, 26(5): 607-609.
  • 5APOSTOLICO A, FRAENKEL A S. Robust transmission of unbounded strings using Fibonacci representations[J]. IEEE Trans Inform Theory, 1987, 33(2): 238-245.
  • 6WANG M. Almost asymptotically optimal flag encoding of the integers[J]. IEEE Trans Inform Theory, 1988, 34(2): 324-326.
  • 7YAMAMOTO H, OCHI H. A new asymptotically optimal code for the positive integers[J]. IEEE Trans Inform Theory, 1991, 37(5): 1420-1429.
  • 8AMEMIYA T, YAMAMOTO H. A new class of the universal representation for the positive integers[J]. IEICE Trans Fundamentals,1993, 76(3): 447-452.
  • 9FRAENKEL A S, KLEIN S T. Robust universal complete codes for transmission and compression[J]. Discr Appl Math, 1996, 64(1):31-55.
  • 10FENWICK P. Variable-length integer codes based on the Goldbach conjecture, and other additive codes[J]. IEEE Trans Inform Theory,2002, 48(8): 2412-2417.

二级参考文献18

  • 1Golomb S W. Run-length encodings [J]. IEEE Trans. on Info.Theory, 1966, 12(3): 399 - 401.
  • 2Weinberger M J, Seroussi G, Sapiro G. The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS [J]. IEEE Trans. on Image Processing, 2000, 9(8):1309- 1324.
  • 3Rice R F. Some practical universal noiseless coding techniques--Part Ⅲ[R]. Technical Report JPL-91-3, Jet Propulsion Laboratory,Pasadena, CA, 1991.
  • 4Gallager R G, Voorhis D C V. Optimal source codes for geometrically distributed integer alphabets [J]. IEEE Trans. onInfo. Theory, 1975, 21(2): 228- 230.
  • 5Szpankowski W. Asymptotic average redundancy of Huffman(and other) block codes [J]. IEEE Trans. on Info. Theory, 2000,46(7): 2434 - 2443.
  • 6Merhav N, Seroussi G, Weinberger M J. Optimal prefix codes for sources with two-sided geometric distributions [J]. IEEE Trans.on Info. Theory, 2000, 46(1): 121 - 135.
  • 7Howard P G. The design and analysis of efficient Iossless data compression systems [D]. Rhode Island: Brown University, 1993.
  • 8Fenwick E Punctured Elias codes for variable-length coding of the integers [R]. Technical Report 137, Dept of Computer Science,The University of Auckland, New Zealand, December 1996.
  • 9Elias P. Universal codeword sets and representations of the integers [J]. IEEE Trans. on Info. Theory, 1975, 21(2): 194 - 203.
  • 10Lakshmanan K B. On universal codeword sets [J]. IEEE Trans. on Info. Theory, 1981, 27(5): 659- 662.

共引文献3

通信学报
2005年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部