Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 9, 2008 | Published
Book Section - Chapter Open

On Source Coding with Coded Side Information for a Binary Source with Binary Side Information

Abstract

The lossless rate region for the coded side information 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.

Additional Information

© Copyright 2007 IEEE. Reprinted with permission. Current Version Published: 2008-07-09. This material is based upon work partially supported by NSF Grant No. CCR-0325324 and Caltech's Lee Center for Advanced Networking.

Attached Files

Published - GUWisit07.pdf

Files

GUWisit07.pdf
Files (300.3 kB)
Name Size Download all
md5:ab753d30f29f537c92ebd6e04babffde
300.3 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023