Results 171 to 180 of about 30,630 (205)
Some of the next articles are maybe not open access.
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
Reversible Data Hiding in Encrypted Images Based on Multi-MSB Prediction and Huffman Coding
IEEE Transactions on Multimedia, 2020Zhaoxia Yin +2 more
exaly
Balance of 0, 1 Bits for Huffman and Reversible Variable-Length Coding
IEEE Transactions on Communications, 2004Ke-Chu Yi
exaly
Condensed Table of Huffman Coding, a New Approach to Efficient Decoding
IEEE Transactions on Communications, 2004R Hashemian
exaly