A Matrix Completion Approach to Linear Index Coding Problem
Information Theory
2014-08-14 v1 math.IT
Abstract
In 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.
Cite
@article{arxiv.1408.3046,
title = {A Matrix Completion Approach to Linear Index Coding Problem},
author = {Homa Esfahanizadeh and Farshad Lahouti and Babak Hassibi},
journal= {arXiv preprint arXiv:1408.3046},
year = {2014}
}
Comments
5 pages, 7 figures, and 1 table submitted to ITW 2014