Computer Science – Information Theory
Scientific paper
2012-03-04
Computer Science
Information Theory
submitted to ISIT 2012, extended version
Scientific paper
This paper presents a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework is used to prove various new results. To express the main tool, consider a set of discrete memoryless correlated sources (DMCS). Assume that each source (except one, $Z^n$) is randomly binned at a finite rate. We find sufficient conditions on these rates such that the bin indices are nearly mutually independent of each other and of $Z^n$. This is used in conjunction with the Slepian-Wolf (S-W) result to set up the framework. We begin by illustrating this method via examples from channel coding and rate-distortion (or covering problems). Next, we use the framework to prove a new result on the lossy transmission of a source over a broadcast channel. We also prove a new lower bound to a three receiver wiretap broadcast channel under a strong secrecy criterion. We observe that we can directly prove the strong notion of secrecy without resorting to the common techniques, e.g., the leftover hash lemma. We have also used our technique to solve the problem of two-node interactive channel simulation and the problem of coordination via a relay.
Aref Mohammad Reza
Gohari Amin
Yassaee Mohammad Hossein
No associations
LandOfFree
Achievability proof via output statistics of random binning 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 Achievability proof via output statistics of random binning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievability proof via output statistics of random binning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-331537