Add to ORKGBibliography: leaf 10.Grant N00014-75-C-1183.Part of author's Ph.D. thesis submitted to the M.I.T. Dept. of Electrical Engineering and Computer Science.by Pierre A. Humblet
The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless chann...
AbstractIn this paper, we consider the following question about Huffman coding, which is an importan...
Abstract—This paper presents prefix codes which minimize various criteria constructed as a convex co...
Abstract — Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative ...
Abstract — Huffman coding finds an optimal prefix code for a given probability mass function. Consid...
Data compression via block-adaptive Huffman coding is considered. The compressor consecutively proce...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
The following question about Huffman coding, which is an important technique for compressing data fr...
Abstract-If optimality is measured by average codeword length, Huffman's algorithm gives optima...
In his classic paper of 1948, Claude Shannon considered the problem of efficiently describing a sour...
[[abstract]]Given a discrete memoryless source X, it is well known that the expected codeword length...
[[abstract]]In this paper, we consider the exponentially weighted average codeword length introduced...
We consider the following variant of Huffman coding in which the costs of the letters, rather than t...
A new algorithm for constructing nearly optimal prefix codes in the case of unequal letter costs and...
In the standard Huffman coding problem, one is given a set of words and for each word a positive fre...
The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless chann...
AbstractIn this paper, we consider the following question about Huffman coding, which is an importan...
Abstract—This paper presents prefix codes which minimize various criteria constructed as a convex co...
Abstract — Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative ...
Abstract — Huffman coding finds an optimal prefix code for a given probability mass function. Consid...
Data compression via block-adaptive Huffman coding is considered. The compressor consecutively proce...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
The following question about Huffman coding, which is an important technique for compressing data fr...
Abstract-If optimality is measured by average codeword length, Huffman's algorithm gives optima...
In his classic paper of 1948, Claude Shannon considered the problem of efficiently describing a sour...
[[abstract]]Given a discrete memoryless source X, it is well known that the expected codeword length...
[[abstract]]In this paper, we consider the exponentially weighted average codeword length introduced...
We consider the following variant of Huffman coding in which the costs of the letters, rather than t...
A new algorithm for constructing nearly optimal prefix codes in the case of unequal letter costs and...
In the standard Huffman coding problem, one is given a set of words and for each word a positive fre...
The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless chann...
AbstractIn this paper, we consider the following question about Huffman coding, which is an importan...
Abstract—This paper presents prefix codes which minimize various criteria constructed as a convex co...