Add to ORKGIn this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding problem is devised in order to find the optimum transmission rate given vector length and size of the field. The new approach can be applied to both scalar and vector linear index coding
A single unicast index coding problem (SUICP) with symmetric neighboring and consecutive side- infor...
An index coding problem arises when there is a single source with a number of messages and multiple ...
Abstract—This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless...
Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers w...
Abstract—We study index-coding problems (one sender broad-casting messages to multiple receivers) wh...
Let X* be a n_1 × n_2 matrix with entries in F_2 and rank r <; min(n_1, n_2) (often r ≪ min(n_1, n_2...
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}...
The index coding problem with side information (ICSI) was introduced by Birk and Kol, 1998. In this ...
An index code is said to be locally decodable if each receiver can decode its demand using its side ...
The index coding problem has recently attracted a significant attention from the research community ...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract — The min-rank of a digraph was shown to represent the length of an optimal scalar linear s...
Index coding with side information (ICSI) problems can be represented as matrices. These matrices ha...
An index coding problem arises when there is a single source with a number of messages and multiple ...
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equa...
A single unicast index coding problem (SUICP) with symmetric neighboring and consecutive side- infor...
An index coding problem arises when there is a single source with a number of messages and multiple ...
Abstract—This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless...
Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers w...
Abstract—We study index-coding problems (one sender broad-casting messages to multiple receivers) wh...
Let X* be a n_1 × n_2 matrix with entries in F_2 and rank r <; min(n_1, n_2) (often r ≪ min(n_1, n_2...
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}...
The index coding problem with side information (ICSI) was introduced by Birk and Kol, 1998. In this ...
An index code is said to be locally decodable if each receiver can decode its demand using its side ...
The index coding problem has recently attracted a significant attention from the research community ...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract — The min-rank of a digraph was shown to represent the length of an optimal scalar linear s...
Index coding with side information (ICSI) problems can be represented as matrices. These matrices ha...
An index coding problem arises when there is a single source with a number of messages and multiple ...
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equa...
A single unicast index coding problem (SUICP) with symmetric neighboring and consecutive side- infor...
An index coding problem arises when there is a single source with a number of messages and multiple ...
Abstract—This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless...