Sciweavers

185 search results - page 3 / 37
» On the Capacity of Non-Coherent Network Coding
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—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...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
INFOCOM
2012
IEEE
11 years 9 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
CISS
2008
IEEE
13 years 9 months ago
Network coding on line networks with broadcast
An achievable rate region for line networks with edge and node capacity constraints and broadcasting is derived. The region is the capacity region if the broadcast channels are ort...
Gerhard Kramer, S. M. Sadegh Tabatabaei Yazdi, Ser...
ICC
2009
IEEE
116views Communications» more  ICC 2009»
13 years 5 months ago
Network Coding Does Not Change the Multicast throughput Order of Wireless Ad Hoc Networks
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpou...
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar