
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code
Tsutomu KAWABATA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E82A
No.10
pp.22082209 Publication Date: 1999/10/25 Online ISSN:
DOI: Print ISSN: 09168508 Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications) Category: Source Coding Keyword: average cost, variable length code, source coding, balanced tree,
Full Text: PDF>>
Summary:
We consider the optimal average cost of variable length source code averaged with a given probability distribution over source messages. The problem was argued in Csiszar and Korner's book. In a special case of binary alphabet, we find an upper bound to the optimal cost minus an ideal cost, where the ideal cost is the entropy of the source divided by a unique scalar that makes negative costs logarithmic probabilities. Our bound is better than the one given in the book.

