Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information

Abstract

This paper studies a special class of multicast index coding problems where a sender transmits messages to multiple receivers, each with some side information. Here, each receiver knows a unique message a priori, and there is no restriction on how many messages each receiver requests from the sender. For this class of multicast index coding problems, we obtain the optimal index code, which has the shortest codelength for which the sender needs to send in order for all receivers to obtain their (respective) requested messages. This is the first class of index coding problems where the optimal index codes are found. In addition, linear index codes are shown to be optimal for this class of index coding problems.

Author's final version (to be presented at ICC 2012)

Cited by in corpus (9)

• Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers
• Low-Complexity Decoding for Symmetric, Neighboring and Consecutive Side-information Index Coding Problems
• The Multi-Sender Multicast Index Coding
• Duality Codes and the Integrality Gap Bound for Index Coding
• Capacity of Some Index Coding Problems with Symmetric Neighboring Interference
• On Index Codes for Interlinked Cycle Structured Side-Information Graphs
• On Optimal Index Codes for Interlinked Cycle Structures with Outer Cycles
• Noisy Index Coding with Quadrature Amplitude Modulation (QAM)
• Index Coding Problem with Side Information Repositories