Graph-theoretic approaches to two-sender index coding
Consider a communication scenario over a noiseless channel where a sender is required to
broadcast messages to multiple receivers, each having side information about some …
broadcast messages to multiple receivers, each having side information about some …
Optimal finite-length and asymptotic index codes for five or fewer receivers
L Ong - IEEE Transactions on Information Theory, 2017 - ieeexplore.ieee.org
Index coding models broadcast networks in which a sender sends different messages to
different receivers simultaneously, where each receiver may know some of the messages a …
different receivers simultaneously, where each receiver may know some of the messages a …
Local partial clique covers for index coding
Index coding, or broadcasting with side information, is a network coding problem of most
fundamental importance. In this problem, given a directed graph, each vertex represents a …
fundamental importance. In this problem, given a directed graph, each vertex represents a …
Local partial clique and cycle covers for index coding
We present a generalized novel upper-bound (and encoding scheme)-in the form of the
minimum value of a linear program-for optimal index coding. Our scheme combines the …
minimum value of a linear program-for optimal index coding. Our scheme combines the …
Linear programming approximations for index coding
Index coding, a source coding problem over broadcast channels, has been a subject of both
theoretical and practical interests since its introduction (by Birk and Kol, 1998). In short, the …
theoretical and practical interests since its introduction (by Birk and Kol, 1998). In short, the …
Independent user partition multicast scheme for the groupcast index coding problem
The groupcast index coding (GIC) problem is a generalization of the index coding problem,
where one packet can be demanded by multiple users. In this paper, we propose a new …
where one packet can be demanded by multiple users. In this paper, we propose a new …
A class of index coding problems with rate 1/3
An index coding problem with n messages has symmetric rate R if all n messages can be
conveyed at rate R. In a recent work, a class of index coding problems for which symmetric …
conveyed at rate R. In a recent work, a class of index coding problems for which symmetric …
[PDF][PDF] Design and Analysis of Efficient Index Coding Methods for Future Wireless Communications
A Sharififar - 2023 - unsworks.unsw.edu.au
This thesis considers the problem of efficient broadcast in a system where a single server
transmits a set of messages to a number of users via a noiseless broadcast channel. Each …
transmits a set of messages to a number of users via a noiseless broadcast channel. Each …
Multi-Sender Index Coding Over Linear Networks
We consider an index coding problem in which several transmitters deliver distinct files to a
number of users with minimum delay. Each user has access to a subset of other files from …
number of users with minimum delay. Each user has access to a subset of other files from …
Optimal Index Codes via a Duality between Index Coding and Network Coding
A Choudhary, VK Gummadi… - 2018 Twenty Fourth …, 2018 - ieeexplore.ieee.org
In Index Coding, the goal is to use a broadcast channel as efficiently as possible to
communicate information from a source to multiple receivers which can possess some of the …
communicate information from a source to multiple receivers which can possess some of the …