Results 121 to 130 of about 51,497 (156)
Some of the next articles are maybe not open access.
On the maximum length of Huffman codes
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the competitive optimality of Huffman codes
IEEE Transactions on Information Theory, 1991Let 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
Guaranteed Synchronization of Huffman Codes
Data Compression Conference (dcc 2008), 2008In 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
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
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
Proceedings of IEEE International Symposium on Information Theory, 2002
The efficiency of Huffman decoding is very important for an increased variety of implementations. A method called variable length enumerative table (VLET) decoding is presented which uses enumerative source coding principles to construct a Huffman decoder.
W. Van der Walt, H.C. Ferreira
openaire +1 more source
The efficiency of Huffman decoding is very important for an increased variety of implementations. A method called variable length enumerative table (VLET) decoding is presented which uses enumerative source coding principles to construct a Huffman decoder.
W. Van der Walt, H.C. Ferreira
openaire +1 more source
Two Corollaries to the Huffman Coding Procedure
IEEE Transactions on Information Theory, 1975For 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
Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes
IEEE Journal on Selected Areas in Information Theory, 2022Kengo Hashimoto, Ken-Ichi Iwata
exaly
High-performance reversible data hiding in encrypted images with adaptive Huffman code
2023Guangyong Gao +2 more
exaly