Related papers: On the Index Coding Problem and its Relation to Ne…
Vector perturbation is an encoding method for broadcast channels in which the transmitter solves a shortest vector problem in a lattice to create a perturbation vector, which is then added to the data before transmission. In this work, we…
The millimeter-wave bands have been attracting significant interest as a means to achieve major improvements in data rates and network efficiencies. One significant limitation for use of the millimeter-wave bands for cellular communication…
This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver…
We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrary network topologies, we provide (i) fundamental limits on…
In this work, a relay channel is studied in which a source encoder communicates with a destination decoder through a number of out-of-band relays that are connected to the decoder through capacity-constrained digital backhaul links. This…
This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded…
Network coding has proved its efficiency in increasing the network performance for traditional ad-hoc networks. In this paper, we investigate using network coding for enhancing the throughput of multi-hop cognitive radio networks. We…
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance…
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is…
A variant of the index coding problem (ICP), the embedded index coding problem (EICP) was introduced in [A. Porter and M. Wootters, "Embedded index coding," ITW, Sweden, 2019] which was motivated by its application in distributed computing…
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel matrices. The statistics of the channel matrix enter the…
This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…
The work explores the fundamental limits of coded caching in heterogeneous networks where multiple ($N_0$) senders/antennas, serve different users which are associated (linked) to shared caches, where each such cache helps an arbitrary…
Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins with a unique index that represents its position in the whole…
We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate,…
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…
Coded caching can create coded multicasting thus significantly accelerates content delivery in broadcast channels with receiver caches. While the original delivery scheme in coded caching multicasts each coded message sequentially, it is…
In the application of linear network coding to wireless broadcasting with feedback, we prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite…
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…
Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of…