Multivariate mutual information inspired by secret-key agreement
The capacity for multiterminal secret-key agreement inspires a natural generalization of
Shannon's mutual information from two random variables to multiple random variables …
Shannon's mutual information from two random variables to multiple random variables …
Algebraic algorithms for vector network coding
We develop new algebraic algorithms for scalar and vector network coding. In vector
network coding, the source multicasts information by transmitting vectors of length L, while …
network coding, the source multicasts information by transmitting vectors of length L, while …
Successive omniscience
C Chan, A Al-Bashabsheh, Q Zhou… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
Because the exchange of information among all the users in a large network can take a long
time, a successive omniscience protocol is proposed. Namely, subgroups of users first …
time, a successive omniscience protocol is proposed. Namely, subgroups of users first …
Is non-unique decoding necessary?
SS Bidokhti, VM Prabhakaran - IEEE transactions on …, 2014 - ieeexplore.ieee.org
In multiterminal communication systems, signals carrying messages meant for different
destinations are often observed together at any given destination receiver. Han and …
destinations are often observed together at any given destination receiver. Han and …
Efficient capacity computation and power optimization for relay networks
F Parvaresh, R Etkin - IEEE Transactions on Information Theory, 2013 - ieeexplore.ieee.org
The capacity or approximations to capacity of various single-source single-destination relay
network models has been characterized in terms of the cut-set upper bound. In principle, a …
network models has been characterized in terms of the cut-set upper bound. In principle, a …
Linear perfect secret key agreement
C Chan - 2011 IEEE Information Theory Workshop, 2011 - ieeexplore.ieee.org
A linear scheme is proposed for multiterminal secret key agreement under a private finite
linear source model with public discussion. With a wiretapper observing the public …
linear source model with public discussion. With a wiretapper observing the public …
Algebraic network coding approach to deterministic wireless relay networks
M Kim, M Médard - 2010 48th Annual Allerton Conference on …, 2010 - ieeexplore.ieee.org
The deterministic wireless relay network model, introduced by Avestimehr et al., has been
proposed for approximating Gaussian relay networks. This model, known as the ADT …
proposed for approximating Gaussian relay networks. This model, known as the ADT …
(Secure) linear network coding multicast: A theoretical minimum and some open problems
(Secure) Linear network coding multicast | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Designs …
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Designs …
Multicasting algorithms for deterministic networks
We present a polynomial time algorithm for multicasting rate h to N receivers over
deterministic networks. Our algorithm requires intermediate network nodes to perform …
deterministic networks. Our algorithm requires intermediate network nodes to perform …
A combinatorial study of linear deterministic relay networks
SMST Yazdi, SA Savari - 2010 IEEE Information Theory …, 2010 - ieeexplore.ieee.org
The linear deterministic network model of Avestimehr, Diggavi and Tse has attracted
attention because it captures certain physical aspects of wireless communication such as …
attention because it captures certain physical aspects of wireless communication such as …