On Lower Bounds for the Redundancy of Optimal Codes
Designs, Codes and Cryptography
On the expected codeword length per symbol of optimal prefix codes for extended sources
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
On the expected codeword length per symbol of optimal prefix codes for extended sources
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
Although optimal binary source coding using symbol blocks of increasing length must eventually yield a code having an average codeword length arbitrarily close to the source entropy, it is known that the sequence of average codeword lengths need not be nonincreasing. The sequence is, however, bounded above by the average codeword length of the source, and certain subsequences must be nondecreasing. Sufficient conditions are obtained describing sources for which a decrease in average codeword length is achieved when coding pairs of symbols. A sufficient condition specifying sources for which no such decrease is possible is also obtained.