Name
Abstract | ||
|---|---|---|
When the letter probabilitiesp_1,p_2,cdots,p_Nfor a message sourceSare unknown, it may be imprudent to construct a Huffman code forSbased on the relative frequenciesf_1, f_2,cdots, f_Nof the letters in a sample messageM. Rather, a more cautious approach is to select an integerb geq log_2 Nand to construct the codeC_bwhich encodesMmost efficiently subject to the restriction that codewords are at mostbbits long. This correspondence describes an algorithm for calculatingC_binO((b-log_2 N)N^2)steps. |
Year | DOI | Venue |
|---|---|---|
1974 | 10.1109/TIT.1974.1055176 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
convolutional codes,polynomials,probability,block codes,digital images,huffman codes,source coding,gray scale,fluctuations,binary codes | Integer,Discrete mathematics,Combinatorics,Convolutional code,Polynomial,Block code,Huffman coding,Code word,Mathematics,Variable-length code,Bounded function | Journal |
Volume | Issue | ISSN |
20 | 2 | 0018-9448 |
Citations | PageRank | References |
2 | 0.38 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David C. van Voorhis | 1 | 2 | 1.06 |