Name
Abstract | ||
|---|---|---|
An algorithm is described where given the letter probabilities for a memoryless message source that emitsNletters, onlyO(N^2)steps are required--rather than the previously reportedO(N^3)steps---to construct a code with the minimum average codeword length permitted by the constraint that codeword lengths be monotonically increasing. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1109/TIT.1975.1055314 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Run-length coding,Source coding | Journal | 21 |
Issue | ISSN | Citations |
1 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David C. van Voorhis | 1 | 2 | 1.06 |