Results 161 to 170 of about 30,630 (205)

Synchronizing dynamic Huffman codes

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein, Elina Opalinsky, Dana Shapira   +2 more
openaire   +3 more sources

Minimum Variance Huffman Codes

SIAM Journal on Computing, 1982
Huffman’s well-known coding method constructs a minimum redundancy code which minimizes the expected value of the word length. In this paper, we characterize the minimum redundancy code with the minimum variance of the word length. An algorithm is given to construct such a code. It is shown that the code is in a certain sense unique.
openaire   +2 more sources

Optimal Prefix Codes And Huffman Codes

International Journal of Computer Mathematics, 2003
Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Dongyang Long, Weijia Jia 0001, Ming Li 0002   +2 more
openaire   +1 more source

Self-synchronizing Huffman codes

IEEE Trans. Inf. Theory, 2020
Summary: A problem associated with the use of variable-length source codes is that loss of synchronization may lead to extended errors in the decoded text. In this correspondence it is shown that some binary Huffman codes contain a codeword that resynchronizes the decoder regardless of the synchronization slippage preceding that codeword.
Thomas J. Ferguson, J. H. Rabinowitz
openaire   +2 more sources

Algorithms for adaptive Huffman codes

Information Processing Letters, 1984
L'algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de transmissions connues. On considere ici seulement les codes d'Huffman binaires. On decrit un algorithme qui peut etre generalise, mais le systeme binaire reste certainement le mieux adapte aux applications ...
Gordon V. Cormack, R. Nigel Horspool
openaire   +1 more source

Huffman coding with an infinite alphabet

IEEE Transactions on Information Theory, 1996
Summary: A new type of sufficient condition is provided for a probability distribution on the nonnegative integers to be given an optimal \(D\)-ary prefix code by a Huffman-type algorithm. In the justification of our algorithm, we introduce two new (essentially one) concepts as the definition of the ``optimality'' of a prefix \(D\)-ary code, which are ...
Akiko Kato, Te Sun Han, Hiroshi Nagaoka
openaire   +2 more sources

Bounds on the redundancy of Huffman codes

IEEE Trans. Inf. Theory, 2020
New 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, Raffaele Giancarlo, Inder Jeet Taneja   +2 more
openaire   +2 more sources

An application of the Hopfield model to Huffman codes

IEEE Transactions on Information Theory, 1993
Summary: 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

On the maximum length of Huffman codes

Information Processing Letters, 1993
zbMATH 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, 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