Related papers: Linear Network Coding for Multiple Groupcast Sessi…
Hinging on ideas from physical-layer network coding, some promising proposals of coded random access systems seek to improve system performance (while preserving low complexity) by means of packet repetitions and decoding of linear…
Comparative analyses of graph structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large…
We present a framework to study linear deterministic interference networks over finite fields. Unlike the popular linear deterministic models introduced to study Gaussian networks, we consider networks where the channel coefficients are…
We consider the multi-access coded caching problem, which contains a central server with $N$ files, $K$ caches with $M$ units of memory each and $K$ users where each one is connected to $L (\geq 1)$ consecutive caches, with a cyclic…
We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize…
We apply linear network coding (LNC) to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels, assuming each receiver already possesses a subset of these packets and wants the rest. We aim to…
We revisit existing linear computation coding (LCC) algorithms, and introduce a new framework that measures the computational cost of computing multidimensional linear functions, not only in terms of the number of additions, but also with…
A new coding technique, based on \textit{fixed block-length} codes, is proposed for the problem of communicating a pair of correlated sources over a $2-$user interference channel. Its performance is analyzed to derive a new set of…
We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious").…
We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first…
In this paper, distributed (or multiterminal) source coding with one distortion criterion and correlated messages is considered. This problem can be also called ``Berger-Yeung problem with correlated messages''. It corresponds to the source…
Network Coding is a packet encoding technique which has recently been shown to improve network performance (by reducing delays and increasing throughput) in broadcast and multicast communications. The cost for such an improvement comes in…
In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. In this work, we present a framework of non-local network coding by exploiting a Bell scenario and show the usefulness of…
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e.…
Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of…
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a…
The problem of multicasting two nested messages is studied over a class of networks known as combination networks. A source multicasts two messages, a common and a private message, to several receivers. A subset of the receivers (called the…
Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast…
We consider single-antenna interference networks where M sources, each with an average transmit power of P/M, communicate with M destinations over frequency-selective channels (with L taps each) and each destination has perfect knowledge of…