Results 141 to 150 of about 1,245 (171)

Guaranteed Synchronization of Huffman Codes

Data Compression Conference (dcc 2008), 2008
In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting such error propagation to not more than L bits, L being a parameter of the algorithm. The method utilizes the inherent tendency of the codes to synchronize spontaneously and does not introduce any redundancy if such a ...
openaire   +1 more source

Modified JPEG huffman coding

IEEE Transactions on Image Processing, 2003
It is a well observed characteristic that when a DCT block is traversed in the zigzag order, the AC coefficients generally decrease in size and the run-length of zero coefficients increase in number. This article presents a minor modification to the Huffman coding of the JPEG baseline compression algorithm to exploit this redundancy.
openaire   +2 more sources

On the competitive optimality of Huffman codes

IEEE Transactions on Information Theory, 1991
Let X be a discrete random variable drawn according to a probability mass function p(x), and suppose p(x), is dyadic, i.e., log(1/p(x)) is an integer for each x. It is shown that the binary code length assignment l(x)=log(1/p(x)) dominates any other uniquely decodable assignment l'(x) in expected length in the sense that El(X) Pr(l (X)>l'(X)), which ...
openaire   +1 more source

Two Corollaries to the Huffman Coding Procedure

IEEE Transactions on Information Theory, 1975
For a given set of N symbols to be coded by a code of alphabet size D , the necessary and sufficient conditions for the optimality of a block code of length m , if N = D^m , and the optimality of a code of words of length only m and m + 1 , if D^m , are stated, and an example of the construction of such a code is given.
openaire   +1 more source

Huffman Coding

2006
  +4 more sources

Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes

IEEE Journal on Selected Areas in Information Theory, 2022
Ken-Ichi Iwata, Kengo Hashimoto
exaly  

Mixed Huffman codes for on-line and off-line applications

2022
Grzegorz Ulacha, Ryszard Stasinski
exaly  

Approximating Huffman codes in parallel

Journal of Discrete Algorithms, 2007
M Karpinski, P Berman
exaly  

A parallel decoder of programmable Huffman codes

IEEE Transactions on Circuits and Systems for Video Technology, 1995
T H Meng, B W Y Wei
exaly  

Maximal codeword lengths in Huffman codes

Computers and Mathematics With Applications, 2000
R J Mceliece
exaly