36 search results - page 1 / 8 » On the Hardness of Approximating the Network Coding Capacity |
TIT
2011
12 years 12 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
INFOCOM
2010
IEEE
2010
IEEE
Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints
13 years 2 months ago
Multimedia streaming applications have stringent QoS requirements. Typically each packet is associated with a packet delivery deadline. This work models and considers realtime stre...
MOBIHOC
2007
ACM
14 years 4 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...