Unicast-Uniprior Index Coding Problems: Minrank and Criticality

Ambadi, N (2019) Unicast-Uniprior Index Coding Problems: Minrank and Criticality. In: 16th International Symposium ""Problems of Redundancy in Information and Control Systems"", REDUNDANCY 2019, 21-25, October 2019, Moscow, pp. 81-86.

PDF int_sym_pro_red_inf_con_sys_81-86_2019.pdf - Published Version Restricted to Registered users only Download (322kB) | Request a copy

Abstract

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, an algorithm is given 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, some properties that are exclusive to the fitting matrix of a unicast-uniprior problem are established. These properties are then used to lay down the algorithm that computes the minrank.

Item Type:	Conference Paper
Publication:	2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	cited By 0; Conference of 16th International Symposium ""Problems of Redundancy in Information and Control Systems"", REDUNDANCY 2019 ; Conference Date: 21 October 2019 Through 25 October 2019; Conference Code:157947
Keywords:	Control systems, Apriori; Index coding; Side information; Unicast, Redundancy
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 Aug 2020 05:46
Last Modified:	18 Aug 2020 05:46
URI:	http://eprints.iisc.ac.in/id/eprint/65005

Actions (login required)

View Item