The interlinked cycle (IC) structure that generalizes cycles and cliques was defined by Thapa, Ong, and Johnson. Interlinked-cycle-cover (ICC) scheme that leverages IC structures in digraphs to construct scalar linear index codes was proposed. A class of infinitely many digraphs, where the proposed scalar linear codes based on ICC scheme are optimal were characterized by Thapa et. al. In this paper, we provide an addition to this class by providing optimal length index codes for IC structures with one cycle among non-inner vertex set
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
This paper considers a base station that delivers packets to multiple receivers through a sequence o...
Abstract—We study zero-error unicast index-coding instances, where each receiver must perfectly deco...
The interlinked cycle (IC) structure that generalizes cycles and cliques was defined by Thapa, Ong, ...
The interlinked cycle (IC) structure, that generalizes cycles and cliques was defined by Thapa, Ong ...
Index code construction and decoding algorithm for side-information graphs called interlinked cycle ...
We study the index coding problem in the unicast message setting, i.e., where each message is reques...
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has K re...
A source coding problem over a noiseless broadcast channel where the source is preinformed about the...
The min-rank of a digraph was shown to represent the length of an optimal scalar linear solution of ...
Abstract—We study index-coding problems (one sender broad-casting messages to multiple receivers) wh...
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
In this work we study both the index coding with side information (ICSI) problem introduced by Birk ...
Abstract—In this paper, linear binary index coding is con-sidered. It is shown that the minimum cliq...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
This paper considers a base station that delivers packets to multiple receivers through a sequence o...
Abstract—We study zero-error unicast index-coding instances, where each receiver must perfectly deco...
The interlinked cycle (IC) structure that generalizes cycles and cliques was defined by Thapa, Ong, ...
The interlinked cycle (IC) structure, that generalizes cycles and cliques was defined by Thapa, Ong ...
Index code construction and decoding algorithm for side-information graphs called interlinked cycle ...
We study the index coding problem in the unicast message setting, i.e., where each message is reques...
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has K re...
A source coding problem over a noiseless broadcast channel where the source is preinformed about the...
The min-rank of a digraph was shown to represent the length of an optimal scalar linear solution of ...
Abstract—We study index-coding problems (one sender broad-casting messages to multiple receivers) wh...
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
In this work we study both the index coding with side information (ICSI) problem introduced by Birk ...
Abstract—In this paper, linear binary index coding is con-sidered. It is shown that the minimum cliq...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
This paper considers a base station that delivers packets to multiple receivers through a sequence o...
Abstract—We study zero-error unicast index-coding instances, where each receiver must perfectly deco...