Coordination via a relay

Haddadpour, Farzin; Yassaee, Mohammad Hossein; Gohari, Amin; Aref, Mohammad Reza

doi:10.1109/isit.2012.6284121

Cited by 29 publications

(43 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed method has a simple structure (using only random binning), and can solve some problems much easier than the traditional techniques; see [35,36] for two examples that are not included in this manuscript. These examples consider the problems of channel simulation and coordination.…”

Section: Advantages Of the Proposed Methodsmentioning

confidence: 99%

“…In this section we investigate our framework for multihop setting through studying wiretap relay channel. As other applications of the OSRB framework in multi-hopping setting, please see [35] and [36]. In particular, our proof for the problem of interactive channel simulation (synthesis) [35] is a reminiscent of two well-known strategies for relay channel, namely decode-forward and compress-forward.…”

Section: Relay Channel With/without Secrecymentioning

confidence: 98%

“…However the two frameworks have significant differences in terms of codebook construction and proofs. We consider our framework simpler and more general for the following reason: Cuff's framework is not easily applicable to complicated network structures (such as coordination with relay [36]), since if one were to extend Cuff's "softcovering" lemma to these scenarios, one has to define various mutual soft-covering lemmas and various codebook constructions (just like the traditional mutual covering lemmas). Further, binning provides a common framework and bypasses the need for proving mutual covering lemmas.…”

Section: Related Previous Workmentioning

confidence: 99%

“…One important application of our framework is to prove achievability part of the channel simulation problems, see [35,36,37]. In this subsection, we illustrate how our achievability framework can be adopted to prove the achievability part of channel simulation problems over networks.…”

Section: Distributed Channel Synthesismentioning

confidence: 99%

See 3 more Smart Citations

Achievability Proof via Output Statistics of Random Binning

Yassaee

Aref

Gohari

2014

IEEE Trans. Inform. Theory

Self Cite

138

200

View full text Add to dashboard Cite

This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Further, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates "for free."We make a case for generality of the framework by studying examples in the variety of settings containing channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to hybrid coding scheme. Also, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish achievability results for coordination problems including interactive channel simulation, coordination via relay and channel simulation via another channel.

show abstract

Section: Advantages Of the Proposed Methodsmentioning

confidence: 99%

Section: Relay Channel With/without Secrecymentioning

confidence: 98%

Section: Related Previous Workmentioning

confidence: 99%

Section: Distributed Channel Synthesismentioning

confidence: 99%

See 2 more Smart Citations

Achievability Proof via Output Statistics of Random Binning

Yassaee

Aref

Gohari

2014

IEEE Trans. Inform. Theory

Self Cite

138

200

View full text Add to dashboard Cite

show abstract

“…Recent work has generalized this setup to interactive communication [12] and a general characterization was been recently obtained by Yassaee et al [13]. A number of different scenarios for three terminals trying to coordinate actions was studied by Cuff et al [14], and a recent relay model was considered by Haddadpour et al [15] that also recovers some of the channel synthesis results [6], [11].…”

Section: Introductionmentioning

confidence: 99%

Assisted sampling of correlated sources

Prabhakaran

Sarwate

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-We study a distributed sampling scenario in which two agents observing components of a correlated source must each generate components of a second correlated source. The agents are aided by an "omniscient" third terminal which observes the two input sources and transmits rate-limited messages to assist the terminals in generating the required correlation in their outputs. We identify two sub-cases of this problem based on how the generated sources must depend on the input sources.

show abstract

Joint coordination-channel coding for strong coordination over noisy channels based on polar codes

Obead¹,

Kliewer²,

Vellambi³

2017

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents X and Y, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions follows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DMC and shared randomness are together employed to simulate another DMC. In particular, our proposed solution is able to utilize the randomness of the DMC to reduce the amount of local randomness required to generate the sequence of actions at agent Y. By leveraging our earlier random coding results for this problem, we conclude that the proposed joint coordinationchannel coding scheme strictly outperforms a separate scheme in terms of achievable communication rate for the same amount of injected randomness into both systems.

show abstract

Coordination via a relay

Cited by 29 publications

References 10 publications

Achievability Proof via Output Statistics of Random Binning

Achievability Proof via Output Statistics of Random Binning

Assisted sampling of correlated sources

Joint coordination-channel coding for strong coordination over noisy channels based on polar codes

Contact Info

Product

Resources

About