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

01/01/2019
by   Mahesh Babu Vaddi, et al.
0

The length of an optimal scalar linear index code of a groupcast index coding problem is equal to the minrank of its side information hypergraph. The side-information hypergraph becomes a side-information graph for a special class of groupcast index coding problems known as unicast index coding problems. The computation of minrank is an NP-hard problem. There exists a low rank matrix completion method and clique cover method to find suboptimal solutions to the index coding problem represented by a side-information graph. However, both the methods are NP-hard. The number of computations required to find the minrank depends on the number of edges present in the side-information graph. In this paper, we define the notion of minrank-critical edges in a side-information graph and derive some properties of minrank, which identifies minrank-non-critical edges. Using these properties we present a method for reduction of the given minrank computation problem into a smaller problem. Also, we give an heuristic algorithm to find a clique cover of the side-information graph by using some binary operations on the adjacency matrix of the side-information graph. We also give a method to convert a groupcast index coding problem into a single unicast index coding problem. Combining all these results, we construct index codes (not necessarily optimal length) for groupcast index coding problems. The construction technique is independent of field size and hence can be used to construct index codes over binary field. In some cases the constructed index codes are better than the best known in the literature both in terms of the length of the code and the minimum field size required.

READ FULL TEXT
research
07/13/2021

Index Code Construction via Deep Matrix Factorization

In this paper, we consider the problem of on-demand source coding for co...
research
01/21/2022

Minrank of Embedded Index Coding Problems and its Relation to Connectedness of a Bipartite Graph

This paper deals with embedded index coding problem (EICP), introduced b...
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...
research
10/27/2018

Groupcast Index Coding Problem: Joint Extensions

The groupcast index coding problem is the most general version of the cl...
research
06/18/2020

Market Graph Clustering Via QUBO and Digital Annealing

Our goal is to find representative nodes of a market graph that best rep...
research
04/11/2018

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

Communication problems where a set of messages are distributed among mul...

Please sign up or login with your details

Forgot password? Click here to reset