#### DMCA

## Computation in Multicast Networks: Function Alignment and Converse Theorems (2012)

Citations: | 3 - 3 self |

### Citations

1956 | Network information flow
- AHLSWEDE, CAI, et al.
- 2000
(Show Context)
Citation Context ...cal Engineering and Computer Sciences, University of California, Berkeley, Berkeley, USA (Email: {ngoela, gastpar}@eecs.berkeley.edu) to the classical problem of communication over multicast networks =-=[5]-=-. As a consequence, it was shown that the cut-set based bound is tight in the single-receiver case. Several results over the past decade have contributed to the understanding of classical communicatio... |

1010 | Linear network coding
- Li, Yeung, et al.
- 2003
(Show Context)
Citation Context ...und is tight for multicast communication. Subsequent research developed practical linear network coding strategies ranging from random linear codes to deterministic polynomial-time code constructions =-=[6]-=-, [7], [8], [9]. The success of traditional multicast communication motivates us to explore the fundamental limits of multicasting a linear function in multi-receiver networks as a natural next step. ... |

852 | An algebraic approach to network coding
- Koetter, Medard
(Show Context)
Citation Context ...s tight for multicast communication. Subsequent research developed practical linear network coding strategies ranging from random linear codes to deterministic polynomial-time code constructions [6], =-=[7]-=-, [8], [9]. The success of traditional multicast communication motivates us to explore the fundamental limits of multicasting a linear function in multi-receiver networks as a natural next step. For t... |

586 | A random linear network coding approach to multicast”,IEEE Transactions on Information Theory
- Ho, Köetter, et al.
(Show Context)
Citation Context ...ht for multicast communication. Subsequent research developed practical linear network coding strategies ranging from random linear codes to deterministic polynomial-time code constructions [6], [7], =-=[8]-=-, [9]. The success of traditional multicast communication motivates us to explore the fundamental limits of multicasting a linear function in multi-receiver networks as a natural next step. For this o... |

333 | Network Coding for Distributed Storage Systems
- Dimakis, Godfrey, et al.
- 2007
(Show Context)
Citation Context ...t, Network Decomposition Theorem I. INTRODUCTION Recently coding for computation in networks has received considerable attention with applications in sensor networks [1] and cloud computing scenarios =-=[2]-=-, [3]. In a sensor network, a fusion node may be interested in computing a relevant function of the measurements from various data nodes. In a cloud computing scenario, a client may download a functio... |

314 | Polynomial time algorithms for multicast network code construction
- Jaggi, Sanders, et al.
- 2005
(Show Context)
Citation Context ...r multicast communication. Subsequent research developed practical linear network coding strategies ranging from random linear codes to deterministic polynomial-time code constructions [6], [7], [8], =-=[9]-=-. The success of traditional multicast communication motivates us to explore the fundamental limits of multicasting a linear function in multi-receiver networks as a natural next step. For this open p... |

289 | Wireless network information flow: A deterministic approach
- Avestimehr
(Show Context)
Citation Context ... a linear function (modulo-2 sum) of two independent Bernoulli sources generated at the transmitters. Specifically, we consider the Avestimehr-Diggavi-Tse (ADT) deterministic single-hop network model =-=[13]-=- which captures superposition and broadcast properties of wireless Gaussian networks and is a generalization of networks of orthogonal links. We develop a new achievable coding scheme termed function ... |

210 | Communication over mimo x channels: Interference alignment, decomposition, and performance analysis,” Information Theory
- Maddah-Ali, Motahari, et al.
- 2008
(Show Context)
Citation Context ...ss Gaussian networks and is a generalization of networks of orthogonal links. We develop a new achievable coding scheme termed function alignment 1 , inspired by the concept of interference alignment =-=[15]-=-, [16]. We also derive a new converse theorem that is tighter than cutset based bounds and genie-aided bounds. As a consequence of this capacity result, we find that unlike the single-receiver case, t... |

206 |
Interference alignment and the degrees of freedom for the K user interference channel,” preprint. [Online]. Available: http://arxiv.org/abs/0707.0323
- Cadambe, Jafar
(Show Context)
Citation Context ...ssian networks and is a generalization of networks of orthogonal links. We develop a new achievable coding scheme termed function alignment 1 , inspired by the concept of interference alignment [15], =-=[16]-=-. We also derive a new converse theorem that is tighter than cutset based bounds and genie-aided bounds. As a consequence of this capacity result, we find that unlike the single-receiver case, the cut... |

161 | Insufficiency of linear coding in network information flow
- Dougherty, Freiling, et al.
- 2005
(Show Context)
Citation Context ... in achieving capacity limits, and structured codes achieve higher computation rates [10]; (b) Linear codes are insufficient in general for computation over multi-receiver networks (cf. both [11] and =-=[12]-=-) and non-linear codes may achieve higher computation rates. To make progress on the problem of multicasting a function in multi-receiver networks, we consider the simplest twotransmitter two-receiver... |

156 | Compute-and-Forward: Harnessing interference through structured codes
- Nazer, Gastpar
(Show Context)
Citation Context ...case, the total number of these N2 computable bits is N1+N2+{m−(N1+N2)} = m. Similarly receiver 2 can compute m bits. Therefore, we can achieve Rcomp = m. Remark 3 (Exploiting Channel Structure [10], =-=[19]-=-): In the regime of 1 2 2 ≤ α ≤ 3 , more-than-half of signal levels at receivers naturally form the mod-sum function. This enables us to create a shared linear subspace. Note in the above example that... |

155 | Computing and communicating functions over sensor networks
- Giridhar, Kumar
- 2005
(Show Context)
Citation Context ...puting Capacity, Function Alignment, Network Decomposition Theorem I. INTRODUCTION Recently coding for computation in networks has received considerable attention with applications in sensor networks =-=[1]-=- and cloud computing scenarios [2], [3]. In a sensor network, a fusion node may be interested in computing a relevant function of the measurements from various data nodes. In a cloud computing scenari... |

137 | Computation over multiple-access channels
- Nazer, Gastpar
- 2007
(Show Context)
Citation Context ...next step. For this open problem, some facts are known based on example networks: (a) Random codes are insufficient in achieving capacity limits, and structured codes achieve higher computation rates =-=[10]-=-; (b) Linear codes are insufficient in general for computation over multi-receiver networks (cf. both [11] and [12]) and non-linear codes may achieve higher computation rates. To make progress on the ... |

105 | A Survey on Network Codes for Distributed Storage
- Dimakis, Ramchandran, et al.
- 2011
(Show Context)
Citation Context ...twork Decomposition Theorem I. INTRODUCTION Recently coding for computation in networks has received considerable attention with applications in sensor networks [1] and cloud computing scenarios [2], =-=[3]-=-. In a sensor network, a fusion node may be interested in computing a relevant function of the measurements from various data nodes. In a cloud computing scenario, a client may download a function or ... |

76 | Interference alignment for cellular networks - Suh, Tse - 2008 |

73 | Reducing Repair Traffic for Erasure Codingbased Storage via Interference Alignement
- Wu, Dimakis
- 2009
(Show Context)
Citation Context ...ncept of interference alignment [15], [16] which has shown great potential for a variety of applications such as interference channels [16], cellular networks [20], [21], distributed storage networks =-=[22]-=-, [23], [24] and multiple unicast networks [25], [26]. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignment is to form a desired function whi... |

67 | Feedback capacity of the Gaussian interference channel to within 2 bits
- Suh, Tse
- 2011
(Show Context)
Citation Context ...it is shown that feedback can increase the computing rate. Interestingly the feedback gain is shown to be significant - qualitatively similar to the gain in the two-user Gaussian interference channel =-=[28]-=-, which revealed an unbounded feedback gain: the gap between nonfeedback and feedback capacities can be arbitrarily large as the signalto-noise ratio of each link increases. However, the result of [27... |

64 |
Downlink interference alignment
- Suh, Ho, et al.
- 2011
(Show Context)
Citation Context ... is an instance of the important concept of interference alignment [15], [16] which has shown great potential for a variety of applications such as interference channels [16], cellular networks [20], =-=[21]-=-, distributed storage networks [22], [23], [24] and multiple unicast networks [25], [26]. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignmen... |

49 | Interference alignment in regenerating codes for distributed storage: Necessity and code constructions
- Shah, Rashmi, et al.
- 2012
(Show Context)
Citation Context ...of interference alignment [15], [16] which has shown great potential for a variety of applications such as interference channels [16], cellular networks [20], [21], distributed storage networks [22], =-=[23]-=-, [24] and multiple unicast networks [25], [26]. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignment is to form a desired function while min... |

34 |
Exact-repair MDS code construction using interference alignment
- Suh, Ramchandran
- 2011
(Show Context)
Citation Context ...erference alignment [15], [16] which has shown great potential for a variety of applications such as interference channels [16], cellular networks [20], [21], distributed storage networks [22], [23], =-=[24]-=- and multiple unicast networks [25], [26]. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignment is to form a desired function while minimizin... |

24 | Network coding for multiple unicasts: An interference alignment approach
- Das, Vishwanath, et al.
- 2010
(Show Context)
Citation Context ...h has shown great potential for a variety of applications such as interference channels [16], cellular networks [20], [21], distributed storage networks [22], [23], [24] and multiple unicast networks =-=[25]-=-, [26]. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignment is to form a desired function while minimizing the signal subspace occupied by t... |

24 | Interference channels with ratelimited feedback
- Vahid, Suh, et al.
- 2012
(Show Context)
Citation Context ...understanding of the feedback gain. Moreover it would be more interesting to explore this feedback gain under more realistic scenarios where feedback is , offered through rate-limited bit-piped links =-=[29]-=- or through the corresponding backward communication network [30]. Furthermore, we are interested in extending to more general multi-hop networks [31]. VIII. CONCLUSION We have established the computi... |

23 | Communicating the sum of sources over a network
- Ramamoorthy
- 2008
(Show Context)
Citation Context ...tter two-receiver Avestimehr-Diggavi-Tse (ADT) deterministic network addition, the approach has potential for the design of structured computation codes in larger multi-hop networks. Related Work: In =-=[17]-=-, [11], [18], the computing capacity for multicasting a sum of sources is explored for arbitrary multiple-source multiple-destination networks. Rai and Dey [11] proved that there exists a linear solva... |

21 | Network coding for three unicast sessions: Interference alignment approaches
- Ramakrishnan, Das, et al.
- 2010
(Show Context)
Citation Context ...shown great potential for a variety of applications such as interference channels [16], cellular networks [20], [21], distributed storage networks [22], [23], [24] and multiple unicast networks [25], =-=[26]-=-. But the distinction w.r.t our problem comes from the purpose of alignment. In our problem, the aim of alignment is to form a desired function while minimizing the signal subspace occupied by the sou... |

18 | Network coding for computing: Cut-set bounds
- Appuswamy, Franceschetti, et al.
- 2011
(Show Context)
Citation Context ...gle receiver which computes a function of the original sources. Appuswamy et al. study the fundamental limits of computation for linear and general target function classes for singlereceiver networks =-=[4]-=-. While limited progress has been made for general target functions, the problem of linear function computation in single-receiver networks has been solved in part due to a duality theorem establishin... |

14 | Computation alignment: Capacity approximation without noise accumulation
- Niesen, Nazer, et al.
(Show Context)
Citation Context ...sition approach offers a conceptually simpler proof of achievability which we use to establish the linear computing capacity of L-transmitter L-receiver single-hop networks. In 1 Niesen-Nazer-Whiting =-=[14]-=- introduced a similar scheme in a different context called computation alignment.2 S1 Enc 1 ∼ Ber 1 2 S2 ∼ Ber 1 2 X1 Tx 1 X2 Enc 2 Tx 2 n11 n22 n12 n21 Y1 Rx 1 Dec 1 Y2 Rx 2 Dec 2 ˆ S1 ⊕ S2 ˆ S1 ⊕ S... |

11 | Two-way interference channels
- Suh, Wang, et al.
- 2012
(Show Context)
Citation Context ...eresting to explore this feedback gain under more realistic scenarios where feedback is , offered through rate-limited bit-piped links [29] or through the corresponding backward communication network =-=[30]-=-. Furthermore, we are interested in extending to more general multi-hop networks [31]. VIII. CONCLUSION We have established the computing capacity of a twotransmitter two-receiver ADT symmetric networ... |

6 |
On network coding for sum-networks
- Rai, Dey
- 2012
(Show Context)
Citation Context ...ufficient in achieving capacity limits, and structured codes achieve higher computation rates [10]; (b) Linear codes are insufficient in general for computation over multi-receiver networks (cf. both =-=[11]-=- and [12]) and non-linear codes may achieve higher computation rates. To make progress on the problem of multicasting a function in multi-receiver networks, we consider the simplest twotransmitter two... |

3 |
Communicating the sum of sources over a network,” arXiv:1001.5319
- Ramamoorthy, Langberg
- 2010
(Show Context)
Citation Context ...eiver Avestimehr-Diggavi-Tse (ADT) deterministic network addition, the approach has potential for the design of structured computation codes in larger multi-hop networks. Related Work: In [17], [11], =-=[18]-=-, the computing capacity for multicasting a sum of sources is explored for arbitrary multiple-source multiple-destination networks. Rai and Dey [11] proved that there exists a linear solvably equivale... |

2 | On two unicast wireless networks with destination-tosource feedback
- Wang
- 2012
(Show Context)
Citation Context ...is , offered through rate-limited bit-piped links [29] or through the corresponding backward communication network [30]. Furthermore, we are interested in extending to more general multi-hop networks =-=[31]-=-. VIII. CONCLUSION We have established the computing capacity of a twotransmitter two-receiver ADT symmetric network where each receiver wishes to compute a modulo-2-sum function of two Bernoulli sour... |

1 | Approximate feedback capacity of the Gaussian multicast channel
- Suh, Goela, et al.
- 2012
(Show Context)
Citation Context ...rce two-destination multi-hop networks when the entropy of each source is limited by 2. B. Role of Feedback for Computation The role of feedback for function computation has initially been studied in =-=[27]-=- where it is shown that feedback can increase the computing rate. Interestingly the feedback gain is shown to be significant - qualitatively similar to the gain in the two-user Gaussian interference c... |