- Title
- Optimal finite-length and asymptotic index codes for five or fewer receivers
- Creator
- Ong, Lawrence
- Relation
- IEEE Transactions on Information Theory Vol. 63, Issue 11, p. 7116-7130
- Publisher Link
- http://dx.doi.org/10.1109/TIT.2017.2748562
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2017
- Description
- Index coding models broadcast networks in which a sender sends different messages to different receivers simultaneously, where each receiver may know some of the messages a priori. The aim is to find the minimum (normalized) index codelength that the sender sends. This paper considers unicast index coding, where each receiver requests exactly one message, and each message is requested by exactly one receiver. Each unicast index-coding instances can be fully described by a directed graph and vice versa, where each vertex corresponds to one receiver. For any directed graph representing a unicast index-coding instance, we show that if a maximum acyclic induced subgraph (MAIS) is obtained by removing two or fewer vertices from the graph, then the minimum index codelength equals the number of vertices in the MAIS, and linear codes are optimal for the corresponding index-coding instance. Using this result, we solved all unicast index-coding instances with up to five receivers, which correspond to all graphs with up to five vertices. For 9818 non-isomorphic graphs among all graphs up to five vertices, we obtained the minimum index codelength for all message alphabet sizes; for the remaining 28 graphs, we obtained the minimum index codelength if the message alphabet size is k2 for any positive integer k . This work complements the result by Arbabjolfaei et al. (ISIT 2013), who solved all unicast index-coding instances with up to five receivers in the asymptotic regime, where the message alphabet size tends to infinity.
- Subject
- index coding; broadcast with side information; graph theory; finite-length codes
- Identifier
- http://hdl.handle.net/1959.13/1349545
- Identifier
- uon:30414
- Identifier
- ISSN:0018-9448
- Rights
- © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
- Language
- eng
- Full Text
- Reviewed
- Hits: 893
- Visitors: 1267
- Downloads: 416
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 355 KB | Adobe Acrobat PDF | View Details Download |