Optimal Scalar Linear Index Codes for Three Classes of Two-Sender Unicast Index Coding Problem

04/11/2018
by   Chinmayananda A., et al.
0

Communication problems where a set of messages are distributed among multiple senders, can avail distributed transmissions to reduce the delay in content delivery. One such scenario is the two-sender index coding problem. In this paper, two-sender unicast index coding problem (TUICP) is studied, where the senders possibly have some messages in common, and each receiver requests a unique message. It is analyzed using three independent sub-problems (which are single-sender unicast index coding problems (SUICPs)) and the interactions among them. These sub-problems are described by three disjoint vertex-induced subgraphs of the side-information graph of the TUICP respectively, based on the availability of messages at the senders. The TUICP is classified based on the type of interactions among the sub-problems. Optimal scalar linear index codes for a class of TUICP are obtained using those of the sub-problems. For two classes, we identify a sub-class for which scalar linear codes are obtained using the notion of joint extensions of SUICPs. An SUICP I_E is said to be a joint extension of l SUICPs if the fitting matrices of all the l SUICPs are disjoint submatrices of that of I_E. Joint extensions generalize the notion of rank-invariant extensions. Scalar linear codes and a condition for optimality of the codes are given for a class of joint extensions. Using this result, scalar linear codes and the conditions for their optimality are obtained for two classes of the TUICP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2018

Groupcast Index Coding Problem: Joint Extensions

The groupcast index coding problem is the most general version of the cl...
research
04/04/2019

Optimal Weakly Secure Linear Codes for Some Classes of the Two-Sender Index Coding Problem

The two-sender unicast index coding problem is the most fundamental mult...
research
01/22/2019

Linear Index Coding With Multiple Senders and Extension to a Cellular Network

In this paper, linear index codes with multiple senders are studied, whe...
research
09/23/2020

An Embedded Index Code Construction Using Sub-packetization

A variant of the index coding problem (ICP), the embedded index coding p...
research
01/17/2019

Locality in Index Coding for Large Min-Rank

An index code is said to be locally decodable if each receiver can decod...
research
01/01/2019

A Field-Size Independent Code Construction for Groupcast Index Coding Problems

The length of an optimal scalar linear index code of a groupcast index c...
research
01/25/2022

On the Optimality of Linear Index Coding over the Fields with Characteristic Three

It has been known that the insufficiency of linear coding in achieving t...

Please sign up or login with your details

Forgot password? Click here to reset