A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Unicast-Uniprior Index Coding Problems: Minrank and Criticality
[article]
2019
arXiv
pre-print
An index coding problem is called unicast-uniprior when each receiver demands a unique subset of messages while knowing another unique subset of messages apriori as side-information. In this work, we give an algorithm to compute the minrank of a unicast-uniprior problem. The proposed algorithm greatly simplifies the computation of minrank for unicast-uniprior problem settings, over the existing method whose complexity is exponential in the number of messages. First, we establish some properties
arXiv:1901.04926v1
fatcat:5liwlqnnznc2jhmcplqvxiizxq