Optimal Veetor Linear Index Codes for Some Symmetrie Side Information Problems

Vaddi, Mahesh Babu and Rajan, Sundar B (2016) Optimal Veetor Linear Index Codes for Some Symmetrie Side Information Problems. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 125-129.

PDF IEEE_Int_Sym_Inf_The_125_2016.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy

Abstract

This paper deals with vector linear index codes for multiple unieast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetrie (with respect to the receiver index) two-sided antidotes (side information). Starting from a given multiple unieast index coding problem with K messages and symmetrie one-sided antidotes for which a scalar linear index code (sic) is known, we give a construction procedure whieh constructs a sequence (indexed by m) of multiple unicast index coding problems with symmetrie two-sided antidotes (for the same source) for all of whieh a vector linear code ((m)) is obtained from (sic). Also, it is shown that if (sic) is optimal then ((m)) is also optimal for all m. To our knowledge, this is the first paper whieh gives a method to construct a sequence of optimal vector linear index codes.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	09 Feb 2017 07:26
Last Modified:	09 Feb 2017 07:26
URI:	http://eprints.iisc.ac.in/id/eprint/56190

Actions (login required)

View Item