Fundamentals of index coding
F Arbabjolfaei, YH Kim - Foundations and Trends® in …, 2018 - nowpublishers.com
Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …
fundamental limit and optimal coding schemes for broadcasting multiple messages to …
Storage capacity as an information-theoretic vertex cover and the index coding rate
A Mazumdar, A McGregor… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Motivated by applications in distributed storage, the storage capacity of a graph was recently
defined to be the maximum amount of information that can be stored across the vertices of a …
defined to be the maximum amount of information that can be stored across the vertices of a …
Improved Approximation Algorithms for Index Coding
D Chawin, I Haviv - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
The index coding problem is concerned with broadcasting encoded information to a
collection of receivers in a way that enables each receiver to discover its required data …
collection of receivers in a way that enables each receiver to discover its required data …
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 …
[图书][B] Index coding: Fundamental limits, coding schemes, and structural properties
F Arbabjolfaei - 2017 - search.proquest.com
Originally introduced to minimize the number of transmissions in satellite communication,
index coding is a canonical problem in network information theory that studies the …
index coding is a canonical problem in network information theory that studies the …
Generalized lexicographic products and the index coding capacity
F Arbabjolfaei, YH Kim - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
The index coding problem studies the fundamental limit on broadcasting multiple messages
to their respective receivers with different sets of side information that are represented by a …
to their respective receivers with different sets of side information that are represented by a …
Storage capacity as an information-theoretic analogue of vertex cover
A Mazumdar, A McGregor… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
Motivated by applications in distributed storage, the storage capacity of a graph was recently
defined to be the maximum amount of information that can be stored across the vertices of a …
defined to be the maximum amount of information that can be stored across the vertices of a …
The optimality of partial clique covering for index coding
Partial clique covering is one of the most basic coding schemes for index coding problems,
generalizing clique and cycle covering on the side information digraph and further reducing …
generalizing clique and cycle covering on the side information digraph and further reducing …
Algorithms to Exploit Data Sparsity
L Flodin - 2021 - search.proquest.com
While data in the real world is very high-dimensional, it generally has some underlying
structure; for instance, if we think of an image as a set of pixels with associated color values …
structure; for instance, if we think of an image as a set of pixels with associated color values …