Results 181 to 190 of about 1,801 (211)
Some of the next articles are maybe not open access.
An application of the Hopfield model to Huffman codes
IEEE Transactions on Information Theory, 1993Summary: The discrete neural network model due to Hopfield (1982), and his following developments, allow to tie the dynamical evolution of a neural network to a quantity -- the energy of the network -- which is monotonically decreasing up to a minimum stable point.
Fabris, Francesco, Ricca, Giacomo Della
openaire +3 more sources
Bounds on the redundancy of Huffman codes
IEEE Trans. Inf. Theory, 1986New upper bounds on the redundancy of Huffman codes are provided. A bound that for \(2/9\leq P_ 1\leq 0.4\) is sharper than the bound of Gallager, when the probability of the most likely source letter \(P_ 1\) is the only known probability is presented. The improved bound is the tightest possible for \(1/3\leq P_ 1\leq 0.4\). Upper bounds are presented
Renato M. Capocelli +2 more
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
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
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
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