54 search results - page 1 / 11 » Network Coding for Computing: Cut-Set Bounds |
TIT
2011
12 years 11 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
WIOPT
2010
IEEE
13 years 2 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
WIOPT
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...