2013/05/19 by Sanket Satpathy, Satpathy, Sanket, Paul Cuff +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1305.4314
ISIT 2013, 5 pages, uses IEEEtran.cls
arxiv created 2013/05/19 · arxiv updated 2013/05/21
We investigate channel synthesis in a cascade setting where nature provides an iid sequence Xn at node 1. Node 1 can send a message at rate R1 to node 2 and node 2 can send a message at rate R2 to node 3. Additionally, all 3 nodes share bits of common randomness at rate R0. We want to generate sequences Yn and Zn along nodes in the cascade such that (Xn,Yn,Zn) appears to be appropriately correlated and iid even to an eavesdropper who is cognizant of the messages being sent. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We also solve the problem for arbitrarily long cascades and provide an inner bound for cascade channel synthesis without an eavesdropper.