Vaddi, MB and Rajan, BS (2019) A Field-Size Independent Code Construction for Groupcast Index Coding Problems. In: 2019 IEEE Information Theory Workshop, ITW 2019, 25 - 28 August 2019, Visby.
|
PDF
ITW_2019.pdf - Published Version Download (166kB) | Preview |
Abstract
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 hyper-graph becomes a side-information graph for a special class of groupcast index coding problems known as unicast index coding problems. The number of computations required to find the minrank of a side-information graph 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 to reduce the number of computations required to compute minrank. Apart from this, we give a heuristic method to compute minrank. 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 give a method to construct index codes (with 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 the 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.
| Item Type: | Conference Paper |
|---|---|
| Publication: | 2019 IEEE Information Theory Workshop, ITW 2019 |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Additional Information: | The copyright for this article belongs to the Authors. |
| Keywords: | Capillary flow; Codes (symbols); Graph algorithms; Heuristic algorithms; Optimal systems; Optimization, Adjacency matrices; Binary fields; Binary operations; Code construction; Construction technique; Critical edges; Side information; Special class, Heuristic methods |
| Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
| Date Deposited: | 20 Oct 2022 11:51 |
| Last Modified: | 20 Oct 2022 11:51 |
| URI: | https://eprints.iisc.ac.in/id/eprint/77474 |
Actions (login required)
 |
View Item |
