Assisted sampling of correlated sources

Prabhakaran, Vinod M.; Sarwate, Anand D.

doi:10.1109/isit.2013.6620807

Cited by 3 publications

(5 citation statements)

References 17 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the protocol we assumed that the terminals have access to shared randomness B [1:r] which is not present in the model (note that ω is the real common randomness shared between the two terminals in the model). To get rid of the shared randomness B [1:r] , we would like to condition on a particular instance of B on the LHS of (18). Thus, we want to impose certain constraints on the size of the bins to guarantee that the marginal pmfs do not change.…”

Section: Assign Uniformly and Independently Two Bin Indicesmentioning

confidence: 99%

See 1 more Smart Citation

Channel simulation via interactive communications

Yassaee

Gohari

Aref

2012

2012 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and Anantharam to study the general problem of channel simulation via interactive communication stated above. However only inner and outer bounds for the special case of no shared randomness were obtained in their work. In this paper we settle this problem by providing an exact computable characterization of the multi-round problem. To show this we employ the technique of "output statistics of random binning" that has been recently developed by the authors.

show abstract

Section: Assign Uniformly and Independently Two Bin Indicesmentioning

confidence: 99%

“…] on the LHS of(18). Thus, we want to impose certain constraints on the size of the bins to guarantee that the marginal pmfs do not change.…”

mentioning

confidence: 99%

Channel simulation via interactive communications

Yassaee

Gohari

Aref

2012

2012 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

show abstract

“…For the converse, suppose a rate triplet (R, R 1 , R 2 ) is achievable for q(x). Then, the existing converse arguments [8,Theorem 6], stated in a form suitable to our setting, gives us that there exists R ≥ 0 and jointly distributed random variables (Q, U, V ) such that U & V are independent and uniformly distributed over [1 : 2 R1 ] and [1 : 2 R2 ] respectively such that…”

Section: Proofsmentioning

confidence: 99%

“…The problem of generating correlated random variables via interactive communication has been studied by Gohari and Anantharm [6] and Yassaee et al [7]. Out previous work [8] studies a distributed sampling problem in which a genie can help two processors observing correlated sources to output correlated sequences.…”

Section: Introductionmentioning

confidence: 99%