130 research outputs found

    Empirical Coordination in a Triangular Multiterminal Network

    Full text link
    In this paper, we investigate the problem of the empirical coordination in a triangular multiterminal network. A triangular multiterminal network consists of three terminals where two terminals observe two external i.i.d correlated sequences. The third terminal wishes to generate a sequence with desired empirical joint distribution. For this problem, we derive inner and outer bounds on the empirical coordination capacity region. It is shown that the capacity region of the degraded source network and the inner and outer bounds on the capacity region of the cascade multiterminal network can be directly obtained from our inner and outer bounds. For a cipher system, we establish key distribution over a network with a reliable terminal, using the results of the empirical coordination. As another example, the problem of rate distortion in the triangular multiterminal network is investigated in which a distributed doubly symmetric binary source is available.Comment: Accepted in ISIT 201

    Interactive Relay Assisted Source Coding

    Full text link
    This paper investigates a source coding problem in which two terminals communicating through a relay wish to estimate one another's source within some distortion constraint. The relay has access to side information that is correlated with the sources. Two different schemes based on the order of communication, \emph{distributed source coding/delivery} and \emph{two cascaded rounds}, are proposed and inner and outer bounds for the resulting rate-distortion regions are provided. Examples are provided to show that neither rate-distortion region includes the other one.Comment: Invited Paper submitted to GlobalSIP: IEEE Global Conference on Signal and Information Processing 201

    Secure Cascade Channel Synthesis

    Full text link
    We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence XnX^n locally before initiating communication along the cascade. All nodes share bits of common randomness that are independent of XnX^n. We consider secure synthesis - random variables produced by the system appear to be appropriately correlated and i.i.d. even to an eavesdropper who is cognizant of the communication transmissions. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We find that not only does common randomness help, its usage exceeds the communication rate requirements. The most efficient scheme is based on a superposition codebook, with the first node selecting messages for all downstream nodes. We also provide a fleeting view of related problems, demonstrating how the optimal rate region may shrink or expand.Comment: Submitted to IEEE Transactions on Information Theor
    • …
    corecore