Results 161 to 170 of about 28,330 (190)
Some of the next articles are maybe not open access.
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
Mixed Huffman codes for on-line and off-line applications
2022Ryszard Stasinski, Grzegorz Ulacha
exaly
A parallel decoder of programmable Huffman codes
IEEE Transactions on Circuits and Systems for Video Technology, 1995B W Y Wei, T H Meng
exaly
Approximating Huffman codes in parallel
Journal of Discrete Algorithms, 2007P Berman, M Karpinski
exaly
A simple upper bound on the redundancy of Huffman codes
IEEE Transactions on Information Theory, 2002R W Yeung
exaly
Maximal codeword lengths in Huffman codes
Computers and Mathematics With Applications, 2000R J McEliece
exaly