Some new results on index coding when the number of data is less than the number of receivers

In this paper, index coding problems in which the number (m) of receivers is larger than that (n) of data are considered. Unlike the case that the two numbers are same (n = m), index coding problems with n ≤ m are more general and hard to handle. To circumvent this difficulty, problems with n

Saved in:
Bibliographic Details
Main Authors: Jungho So, Sangwoon Kwak, Youngchul Sung
Format: Conference Proceeding
Language:English
Subjects:
Encoding
Indexes
Materials
Receivers
Transmitters
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, index coding problems in which the number (m) of receivers is larger than that (n) of data are considered. Unlike the case that the two numbers are same (n = m), index coding problems with n ≤ m are more general and hard to handle. To circumvent this difficulty, problems with n
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2014.6874882