Results 141 to 150 of about 28,330 (190)
Some of the next articles are maybe not open access.
Algorithms for adaptive Huffman codes
Information Processing Letters, 1984L'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
exaly +2 more sources
On the maximum length of Huffman codes
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Fast decoding of the Huffman codes
Information Processing Letters, 1988Andrzej Siemiński
exaly +2 more sources
IEEE Transactions on Information Theory, 1996
Summary: We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.
David W. Gillman +2 more
openaire +2 more sources
Summary: We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.
David W. Gillman +2 more
openaire +2 more sources
ACM Computing Surveys, 2014
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques.
openaire +2 more sources
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques.
openaire +2 more sources
Journal of Algorithms, 1985
This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with nonnegative integer weights can be represented in such a way that any weight w at level l can be increased or decreased by unity in O(l) steps, preserving minimality of the weighted path length.
openaire +1 more source
This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with nonnegative integer weights can be represented in such a way that any weight w at level l can be increased or decreased by unity in O(l) steps, preserving minimality of the weighted path length.
openaire +1 more source
Performance comparison of Huffman Coding and Double Huffman Coding
2016 Sixth International Conference on Innovative Computing Technology (INTECH), 2016Huffman coding [11] is a most popular technique for generating prefix-free codes [7, 10]. It is an efficient algorithm in the field of source coding. It produces the lowest possible number of code symbols of a single source symbol [1]. Huffman coding is a most widely used lossless compression technique [2].
Rabia Arshad, Adeel Saleem, Danista Khan
openaire +1 more source
Forward Looking Huffman Coding
Theory of Computing Systems, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein +2 more
openaire +2 more sources
Kybernetes, 2013
Purpose – David Huffman, as a graduate student, earned his immortality by solving a problem that had stumped Claude Shannon, the creator of the field of information theory. How he saw the problem differently and the nature of his discovery have implications for how we get stuck, how we get unstuck, and how the internal ...
openaire +1 more source
Purpose – David Huffman, as a graduate student, earned his immortality by solving a problem that had stumped Claude Shannon, the creator of the field of information theory. How he saw the problem differently and the nature of his discovery have implications for how we get stuck, how we get unstuck, and how the internal ...
openaire +1 more source
Weighted Adaptive Huffman Coding
2020 Data Compression Conference (DCC), 2020Huffman coding is known to be optimal in case the alphabet is known in advance, the set of codewords is fixed and each codeword consists of an integral number of bits. If one of these conditions is violated, optimality is not guaranteed. In the dynamic variant of Huffman coding the encoder and decoder maintain identical copies of the model; at each ...
Aharon Fruchtman +3 more
openaire +1 more source