### Citations

1965 | Network information flow
- Ahlswede, Cai, et al.
(Show Context)
Citation Context ...lishing multicast connections in wireline or wireless networks has been long thought to be NP-Complete using arbitrary directed and undirected network models. With the advent of network coding (ref., =-=[4]-=-, [5], [6]), the breaking of the fluid model for data networks i.e. by performing coding over incoming packets, has been able to intrinsically circumvent the combinatorial hardness of the multicast fl... |

1180 | Nonlinear Programming - Bertsekas - 1999 |

1015 | Linear Network Coding
- Li, Yeung, et al.
(Show Context)
Citation Context ...ng multicast connections in wireline or wireless networks has been long thought to be NP-Complete using arbitrary directed and undirected network models. With the advent of network coding (ref., [4], =-=[5]-=-, [6]), the breaking of the fluid model for data networks i.e. by performing coding over incoming packets, has been able to intrinsically circumvent the combinatorial hardness of the multicast flow pr... |

857 | An algebraic approach to network coding
- Koetter, Médard
- 2003
(Show Context)
Citation Context ...lticast connections in wireline or wireless networks has been long thought to be NP-Complete using arbitrary directed and undirected network models. With the advent of network coding (ref., [4], [5], =-=[6]-=-), the breaking of the fluid model for data networks i.e. by performing coding over incoming packets, has been able to intrinsically circumvent the combinatorial hardness of the multicast flow problem... |

393 | Spectral efficiency in the wideband regime
- Verdú
- 2002
(Show Context)
Citation Context ...is linear in SNR for fading and non-fading channels: C(SNR) = SNR+ o(SNR)(nats/s/Hz). (2) Clearly at low SNR limit, the signal-to-noise ratio per degree of freedom (SNR) approaches unity in the limit =-=[2, 8, 9]-=-. We consider low SNR physically degraded Gaussian broadcast channel, let’s look at the standard model of a single sender and 2 receivers with noise variances N1 and N2 respectively (ref. Fig 1(a)). T... |

204 | Network Optimization: Continuous and Discrete Models. Athena Scientific, - Bertsekas - 1998 |

164 | Minimum-cost multicast over coded packet networks,”
- Lun, Ratnakar, et al.
- 2006
(Show Context)
Citation Context ...umvent the combinatorial hardness of the multicast flow problem. Later, it was shown that minimum cost setting up of multicast connections boils down to optimizing subgraph over coded packet networks =-=[7]-=-. In our problem, since we consider a low SNR wireless network with physically degraded Gaussian broadcast channel (where the number of hyperarcs is equal to n for n receiver nodes, instead of 2n hype... |

139 | Capacity and mutual information of wideband multipath fading channels,
- Telatar, Tse
- 2000
(Show Context)
Citation Context ...ennedy showed that for the Rayleigh fading channel at the infinite bandwidth limit, the capacity is similar to the capacity of the infinite bandwidth AWGN channel with the same average received power =-=[1, 2]-=-. The robustness of this result in the case of with or without channel state information helps us to model generally the low SNR wideband wireless networks. Using it as our underlying information-theo... |

123 |
Fading in Dispersive Communication Channels,
- Kennedy
- 1969
(Show Context)
Citation Context ...ennedy showed that for the Rayleigh fading channel at the infinite bandwidth limit, the capacity is similar to the capacity of the infinite bandwidth AWGN channel with the same average received power =-=[1, 2]-=-. The robustness of this result in the case of with or without channel state information helps us to model generally the low SNR wideband wireless networks. Using it as our underlying information-theo... |

3 | Primal Dual Subgradient Methods for convex problems - Nesterov - 2009 |