Constructing codes with bounded codeword lengths (Corresp.)

When the letter probabilities p_1,p_2,\cdots,p_N for a message source S are unknown, it may be imprudent to construct a Huffman code for S based on the relative frequencies f_1, f_2,\cdots, f_N of the letters in a sample message M . Rather, a more cautious approach is to select an integer b \geq \lo...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 20; no. 2; pp. 288 - 290
Main Author van Voorhis, D.
Format Journal Article
LanguageEnglish
Published IEEE 01.03.1974
Subjects
Block codes
Codes
Convolutional codes
Generators
Genetic communication
Hands
Parity check codes
Probability
Systematics
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.1974.1055176

Cover

More Information
Summary:When the letter probabilities p_1,p_2,\cdots,p_N for a message source S are unknown, it may be imprudent to construct a Huffman code for S based on the relative frequencies f_1, f_2,\cdots, f_N of the letters in a sample message M . Rather, a more cautious approach is to select an integer b \geq \log_2 N and to construct the code C_b which encodes M most efficiently subject to the restriction that codewords are at most b bits long. This correspondence describes an algorithm for calculating C_b in O((b-\log_2 N)N^2) steps.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1974.1055176