Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code (1999)
by
Tsutomu Kawabata
| Citations: | 1 - 0 self |
BibTeX
@MISC{Kawabata99improvementof,
author = {Tsutomu Kawabata},
title = {Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
9.96> x. For a tree T , denote its leaf set by #T := ({#}# {za : z # T,a # A})\T . (For example, T = {#, 0} is a tree and then #T = {00, 01, 1}.) Given probabilities D := {p(1),p(2),...,p(n)}, we want to design a tree T with n leaves and a permutation # of {1, 2,...,n}, suc h that an averagecag defined bellow is minimized. Todesc[F e formally, we denote thelexic]]FOK]S order by ord : #T #{1, 2,...,n}. (In the above exam
Citations
| 17 | Information Theory - Csiszár, Körner - 1981 |
| 8 | An improved bound for weight-balanced trees - Horibe - 1977 |
| 1 | Code and Parse Trees for Lossless Source Encoding - Abraham - 1997 |
| 1 | The Kolmogorov complexity, the universal distribution and the coding with generalized length functions - Kobayashi - 1997 |
