Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2208-2209
- Publication Date
- 1999/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tsutomu KAWABATA, "Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2208-2209, October 1999, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2208/_p
Copy
@ARTICLE{e82-a_10_2208,
author={Tsutomu KAWABATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code},
year={1999},
volume={E82-A},
number={10},
pages={2208-2209},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2208
EP - 2209
AU - Tsutomu KAWABATA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - 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.
ER -
English
