Loading...
Search for: multiterminal-network
0.006 seconds

    Generating dependent random variables over networks

    , Article 2011 IEEE Information Theory Workshop, ITW 2011 ; 2011 , Pages 698-702 ; 9781457704376 (ISBN) Gohari, A. A ; Anantharam, V ; Sharif University of Technology
    Abstract
    In this paper we study the problem of generation of dependent random variables, known as the coordination capacity [4], [5], in multiterminal networks. In this model m nodes of the network are observing i.i.d. repetitions of X (1), X (2),⋯, X (m) distributed according to q(x (1),⋯, x (m)). Given a joint distribution q(x (1),⋯,x (m), y (1), ⋯, y (m)), the final goal of the i th node is to construct the i.i.d. copies of Y (i) after the communication over the network where X (1), X (2),⋯, X (m), Y (1), Y (2),⋯, Y (m) are jointly distributed according to q(x (1), , x (m), y (1),⋯,y (m)). To do this, the nodes can exchange messages over the network at rates not exceeding the capacity constraints... 

    Empirical coordination in a triangular multiterminal network

    , Article IEEE International Symposium on Information Theory - Proceedings ; 2013 , Pages 2149-2153 ; ISSN: 21578095 ; ISBN: 9781479904464 Bereyhi, A ; Bahrami, M ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    2013
    Abstract
    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... 

    Reliable source transmission over relay networks with side information

    , Article 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, 28 June 2009 through 3 July 2009 ; 2009 , Pages 699-703 ; 21578102 (ISSN); 9781424443130 (ISBN) Sefidgaran, M ; Akhbari, B ; Mohsenzadeh, V ; Aref, M. R ; Sharif University of Technology
    2009
    Abstract
    In this paper, we consider reliable transmission of a discrete memoryless source over multi-relay networks with correlated Side Information (SI) available at the relay nodes and the final receiver. We obtain a necessary condition for reliable source transmission over a multi-terminal network with SI, which results in a necessary condition for a multi-relay network with SI, as a special case. We also propose a separate source-channel coding scheme, and based on it, a sufficient condition for a multi-relay network with SI is derived. Based on a partitioning method and the nature of a degraded relay network, we propose another coding scheme which results in a sufficient condition for a degraded...