DocumentCode :
921226
Title :
Constructing codes with bounded codeword lengths (Corresp.)
Author :
van Voorhis, D.
Volume :
20
Issue :
2
fYear :
1974
fDate :
3/1/1974 12:00:00 AM
Firstpage :
288
Lastpage :
290
Abstract :
When the letter probabilities 
for a message source 
are unknown, it may be imprudent to construct a Huffman code for based on the relative frequencies 
of the letters in a sample message 
. Rather, a more cautious approach is to select an integer 
and to construct the code 
which encodes most efficiently subject to the restriction that codewords are at most 
bits long. This correspondence describes an algorithm for calculating in 
steps.
for a message source are unknown, it may be imprudent to construct a Huffman code for based on the relative frequencies of the letters in a sample message . Rather, a more cautious approach is to select an integer and to construct the code which encodes most efficiently subject to the restriction that codewords are at most bits long. This correspondence describes an algorithm for calculating in steps.Keywords :
Source coding; Block codes; Character generation; Convolutional codes; Laboratories; Military computing; Parity check codes; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1974.1055176
Filename :
1055176
Link To Document :
