Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Arbabjolfaei, Fatemeh"'
In index coding, a server broadcasts multiple messages to their respective receivers, each with some side information that can be utilized to reduce the amount of communication from the server. Distributed index coding is an extension of index coding
Externí odkaz:
http://arxiv.org/abs/1801.09063
The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized (single-server)
Externí odkaz:
http://arxiv.org/abs/1701.06033
Autor:
Arbabjolfaei, Fatemeh, Kim, Young-Han
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 directed graph. The generalized lexicographic product structure i
Externí odkaz:
http://arxiv.org/abs/1608.03689
In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all $n$ messages requested by the receivers, in the distributed index coding t
Externí odkaz:
http://arxiv.org/abs/1604.03204
Autor:
Arbabjolfaei, Fatemeh, Kim, Young-Han
For a class of graphs for which the Ramsey number $R(i,j)$ is upper bounded by $ci^aj^b$, for some constants $a,b,$ and $c$, it is shown that the clique covering scheme approximates the broadcast rate of every $n$-node index coding problem in the cla
Externí odkaz:
http://arxiv.org/abs/1602.02422
Autor:
Arbabjolfaei, Fatemeh, Kim, Young-Han
Three science and engineering problems of recent interests -index coding, locally recoverable distributed storage, and guessing games on graphs- are discussed and the connection between their optimal solutions is elucidated. By generalizing recent re
Externí odkaz:
http://arxiv.org/abs/1511.01050
Autor:
Arbabjolfaei, Fatemeh, Kim, Young-Han
The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are establish
Externí odkaz:
http://arxiv.org/abs/1504.06761
Autor:
Arbabjolfaei, Fatemeh, Kim, Young-Han
The question of under what condition some side information for index coding can be removed without affecting the capacity region is studied, which was originally posed by Tahmasbi, Shahrasbi, and Gohari. To answer this question, the notion of unicycl
Externí odkaz:
http://arxiv.org/abs/1504.06760
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding, and has a
Externí odkaz:
http://arxiv.org/abs/1302.1601