Computer Science – Information Theory
Scientific paper
2008-10-10
Computer Science
Information Theory
20 pages, no figures, explanation of a part of impending IEEE IT submission
Scientific paper
Alphabet size of auxiliary random variables in our canonical description is derived. Our analysis improves upon estimates known in special cases, and generalizes to an arbitrary multiterminal setup. The salient steps include decomposition of constituent rate polytopes into orthants, translation of a hyperplane till it becomes tangent to the achievable region at an extreme point, and derivation of minimum auxiliary alphabet sizes based on Caratheodory's theorem.
No associations
LandOfFree
Alphabet Sizes of Auxiliary Variables in Canonical Inner Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Alphabet Sizes of Auxiliary Variables in Canonical Inner Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alphabet Sizes of Auxiliary Variables in Canonical Inner Bounds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-448973