Journal ArticleDOI
Dynamic Huffman coding
TLDR
This note shows how to maintain a prefix code that remains optimum as the weights change, preserving minimality of the weighted path length in a Huffman tree.About:
This article is published in Journal of Algorithms.The article was published on 1985-06-01. It has received 459 citations till now. The article focuses on the topics: Canonical Huffman code & Shannon–Fano coding.read more
Citations
More filters
Book
Introduction to data compression
TL;DR: The author explains the development of the Huffman Coding Algorithm and some of the techniques used in its implementation, as well as some of its applications, including Image Compression, which is based on the JBIG standard.
Journal ArticleDOI
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
TL;DR: LOCO-I as discussed by the authors is a low complexity projection of the universal context modeling paradigm, matching its modeling unit to a simple coding unit, which is based on a simple fixed context model, which approaches the capability of more complex universal techniques for capturing high-order dependencies.
Journal ArticleDOI
Efficient algorithms for online decision problems
TL;DR: This work gives a simple approach for doing nearly as well as the best single decision, where the best is chosen with the benefit of hindsight, and these follow-the-leader style algorithms extend naturally to a large class of structured online problems for which the exponential algorithms are inefficient.
Journal ArticleDOI
Data compression
TL;DR: A variety of data compression methods are surveyed, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986, which has important application in the areas of file storage and distributed systems.
Journal ArticleDOI
Arithmetic coding revisited
TL;DR: A new implementation of arithmetic coding is described that incorporates several improvements over a widely used earlier version by Witten, Neal, and Cleary, which has become a de facto standard and a modular structure that separates the coding, modeling, and probability estimation components of a compression system is described.
References
More filters
Journal ArticleDOI
A Method for the Construction of Minimum-Redundancy Codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
A method for the construction of minimum-redundancy codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
Variations on a theme by Huffman
TL;DR: Four new results about Huffman codes are presented and a simple algorithm for adapting a Huffman code to slowly varying esthnates of the source probabilities is presented.