检索结果-内蒙古大学图书馆

Efficient construction of minimum-redundancy codes for large alphabets

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第4期44卷 1650-1657页

作者： Moffat, A Turpin, A Univ Melbourne Dept Comp Sci Parkville Vic 3052 Australia

We consider the problem of calculating minimum-redundancy codes for alphabets in which there is significant repetition of symbol weights. On a sorted-by-weight alphabet of n symbols and r distinct symbol weights we show that a minimum-redundancy prefix code can be constructed in O (r + rlog(n/r)) time, and that a minimum-redundancy L-bit length-limited prefix code can be constructed in O(Lr + Lrlog(n/r)) time. When I is small relative to n-which is necessarily the case for most practical coding problems on large alphabets-these bounds represent a substantial improvement upon the best previous algorithms for these two problems, which consumed O(n) time and O(nL) time, respectively. The improved algorithms are also space-efficient.

关键词： adaptive algorithm Huffman code length-limited code minimum-redundancy code package-merge algorithm prefix-free code text compression

来源：评论

学校读者我要写书评

暂无评论

Binary codes for locally homogeneous sequences

引用

INFORMATION PROCESSING LETTERS 2006年第5期99卷 175-180页

作者： Moffat, Alistair Anh, Vo Ngoc Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia

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.

关键词： compression coding Elias code Huffman code minimum-redundancy code locally adaptive code information retrieval algorithms

来源：评论

学校读者我要写书评

暂无评论

Decoding prefix codes

引用

SOFTWARE-PRACTICE & EXPERIENCE 2006年第15期36卷 1687-1710页

作者： Liddell, Mike Moffat, Alistair Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia

minimum-redundancy prefix codes have been a mainstay of research and commercial compression systems since their discovery by David Huffman more than 50 years ago. In this experimental evaluation we compare techniques for decoding minimum-redundancy codes, and quantify the relative benefits of recently developed restricted codes that are designed to accelerate the decoding process. We find that table-based decoding techniques offer fast operation, provided that the size of the table is kept relatively small, and that approximate coding techniques can offer higher decoding rates than Huffman codes with varying degrees of loss of compression effectiveness. Copyright (c) 2006 John Wiley & Sons, Ltd.

关键词： Huffmann code minimum-redundancy code prefix code canonical code table-based decoding

来源：评论

学校读者我要写书评

暂无评论

Housekeeping for prefix coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2000年第4期48卷 622-628页

作者： Turpin, A Moffat, A Univ Melbourne Dept Comp Sci & Software Engn Parkville Vic 3052 Australia Univ Melbourne Dept Comp Sci & Software Engn Parkville Vic 3010 Australia

We consider the problem of constructing and transmitting the prelude for Huffman coding. With careful organization of the;required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when S, the size of the source alphabet, is of the same magnitude as m, the length of the message being coded. The proposed structures are of direct relevance in applications that mimic one pass operation through the use of semistatic compression on a block-by block basis.

关键词： adaptive coding canonical code Huffman code minimum-redundancy code prefix code

来源：评论

学校读者我要写书评

暂无评论

It's Been 1,000,000 Years Since Huffman

It's Been 1,000,000 Years Since Huffman

引用

Data Compression Conference (DCC)

作者： Moffat, Alistair Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9781479984305

Summary form only given. Huffman codes are legendary in the computing disciplines, and are embedded in a wide range of critically important communications and storage codecs. With 2015 marking the 64th anniversary of their development -- 1,000,000 years in binary -- it is timely to review Huffman and related codes, and the many mechanisms that have been developed for computing and deploying them.

关键词： Huffman code minimum-redundancy code prefix code Huffman codes

来源：评论

学校读者我要写书评

暂无评论

Huffman Coding

引用

ACM COMPUTING SURVEYS 2019年第4期52卷 85-85页

作者： Moffat, Alistair Univ Melbourne Melbourne Vic 3010 Australia

Huffman's algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques. This article presents a tutorial on Huffman coding and surveys some of the developments that have flowed as a consequence of Huffman's original discovery, including details of code calculation and of encoding and decoding operations. We also survey related mechanisms, covering both arithmetic coding and the recently developed asymmetric numeral systems approach and briefly discuss other Huffman-coding variants, including length-limited codes.

关键词： Huffman code minimum-redundancy code data compression

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：