Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
526,644
A Generalized Cut-Set Bound
, 2009
"... In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network. ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.
Network Coding for Computing: Cut-Set Bounds
, 2011
"... The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e. ..."
Abstract
-
Cited by 19 (4 self)
- Add to MetaCart
the network min-cut upper bound. We extend the definition of min-cut to the network computing problem and show that the min-cut is still an upper bound on the maximum achievable rate and is tight for computing (using coding) any target function in multi-edge tree networks. It is also tight for computing
Cut-Set Bounds on Network Information Flow
, 2013
"... Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general. Characterizing the network coding capacity region requires determina ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
determination of the set of all entropic vectors. Furthermore, computing the explicitly known linear programming bound is infeasible in practice due to an exponential growth in complexity as a function of network size. This paper focuses on the fundamental problems of characterization and computation of outer
Cut-Set Bound 1 Upper Bounds on Relaying Rate
"... Though the unicast capacity of wireless networks is unknown, the upper bound on ca-pacity is known. In [1], Cover et al defined the information theoretic cut-set bound which serves an upper bound for any multi-terminal communications. This is a natural extension of the Max-Flow Min-Cut theorem defin ..."
Abstract
- Add to MetaCart
Though the unicast capacity of wireless networks is unknown, the upper bound on ca-pacity is known. In [1], Cover et al defined the information theoretic cut-set bound which serves an upper bound for any multi-terminal communications. This is a natural extension of the Max-Flow Min-Cut theorem
Reverse Edge Cut-Set Bounds for Secure Network Coding
"... Abstract—We consider the problem of secure communication over a network in the presence of wiretappers. We give a new cut-set bound on secrecy capacity which takes into account the contribution of both forward and backward edges crossing the cut, and the connectivity between their endpoints in the r ..."
Abstract
- Add to MetaCart
Abstract—We consider the problem of secure communication over a network in the presence of wiretappers. We give a new cut-set bound on secrecy capacity which takes into account the contribution of both forward and backward edges crossing the cut, and the connectivity between their endpoints
Information Theoretic Cut-set Bounds on the Capacity of Poisson Wireless Networks
"... Abstract—This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary Poisson node density, size, power and bandwidth, under ..."
Abstract
- Add to MetaCart
Abstract—This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary Poisson node density, size, power and bandwidth, under
Results 1 - 10
of
526,644
