Related papers: Reduced Complexity Index Codes and Improved Upperb…
The topological interference management (TIM) problem refers to the study of the K-user partially connected interference networks with no channel state information at the transmitters (CSIT), except for the knowledge of network topology. In…
A wide range of computer vision algorithms rely on identifying sparse interest points in images and establishing correspondences between them. However, only a subset of the initially identified interest points results in true…
Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers with different demands and with side information. It is known that the problem of finding optimal linear index codes is NP-hard. We…
In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data. We first derive a tight upper bound for the capacity of this…
In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range,…
A problem of index coding with side information was first considered by Y. Birk and T. Kol (IEEE INFOCOM, 1998). In the present work, a generalization of index coding scheme, where transmitted symbols are subject to errors, is studied.…
We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to…
A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…
This paper considers symbol-level precoding (SLP) for multiuser multi-input single-output (MISO) downlink transmission with the aid of intelligent reflecting surface (IRS). Specifically, by assuming one-bit transmitted signals at the base…
Subspace codes were introduced by K\"otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component…
The millimeter-wave (mmWave) communication is envisioned to provide orders of magnitude capacity improvement. However, it is challenging to realize a sufficient link margin due to high path loss and blockages. To address this difficulty, in…
We consider broadcasting a block of packets to multiple wireless receivers under random packet erasures using instantly decodable network coding (IDNC). The sender first broadcasts each packet uncoded once, then generates coded packets…
This work introduces a hypergraph formulation that generalizes the classical paradigm of Bar-Yossef et al. to the multi-sender index coding (MSIC) setting. Central to the model is a 4-regular side-information hypergraph G, a new adjacency…
Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in…
We study a class of discrete memoryless broadcast interference channels (DM-BICs), where one of the broadcast receivers is subject to the interference from a point-to-point transmission. A general achievable rate region $\mathcal{R}$ based…
We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of…
An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…
We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…
Channel memory and inter-symbol interference (ISI) are harmful factors in diffusion-based molecular communication (DBMC) between bionanosensors. To tackle these problems, this paper proposes a lightweight ISI-mitigating coding scheme to…
This paper investigates the linear precoder design for $K$-user interference channels of multiple-input multiple-output (MIMO) transceivers under finite alphabet inputs. We first obtain general explicit expressions of the achievable rate…