Loading...
Please wait, while we are loading the content...
Similar Documents
On source coding with coded side information for a binary source with binary side information (2007)
| Content Provider | CiteSeerX |
|---|---|
| Author | Effros, Michelle Koetter, Ralf Ho, Tracey Gu, Weihsin |
| Abstract | Abstract — The lossless rate region for the coded side informa-tion problem is “solved, ” but its solution is expressed in terms of an auxiliary random variable. As a result, finding the rate region for any fixed example requires an optimization over a family of allowed auxiliary random variables. While intuitive constructions are easy to come by and optimal solutions are known under some special conditions, proving the optimal solution is surprisingly difficult even for examples as basic as a binary source with binary side information. We derive the optimal auxiliary random variables and corresponding achievable rate regions for a family of problems where both the source and side information are binary. Our solution involves first tightening known bounds on the alphabet size of the auxiliary random variable and then optimizing the auxiliary random variable subject to this constraint. The technique used to tighten the bound on the alphabet size applies to a variety of problems beyond the one studied here. I. |
| File Format | |
| Journal | Proceedings of the IEEE International Symposium on Information Theory |
| Publisher Date | 2007-01-01 |
| Access Restriction | Open |
| Subject Keyword | Coded Side Information Lossless Rate Region Fixed Example Auxiliary Random Alphabet Size Intuitive Construction Coded Side Informa-tion Problem Binary Side Information Auxiliary Random Variable Subject Rate Region Optimal Auxiliary Random Variable Alphabet Size Applies Achievable Rate Region Special Condition Auxiliary Random Variable Binary Source |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings |
