Golden-coded index coding

Yu-Chih Huang; Yi Hong; Emanuele Viterbo

doi:10.1109/ISIT.2017.8006989

Golden-coded index coding

Yu-Chih Huang, Yi Hong, Emanuele Viterbo

Electrical and Computer Systems Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

4 Citations (Scopus)

Abstract

We study the problem of constructing good spacetime codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 × 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory (ISIT 2017)
Editors	Martin Bossert, Stephen Hanly, Stephan ten Brink, Sennur Ulukus
Place of Publication	Piscataway NJ USA
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	2548–2552
Number of pages	5
ISBN (Electronic)	9781509040964
ISBN (Print)	9781509040971
DOIs	https://doi.org/10.1109/ISIT.2017.8006989
Publication status	Published - 2017
Event	IEEE International Symposium on Information Theory 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017 https://ieeexplore.ieee.org/xpl/conhome/7999336/proceeding (Proceedings)

Conference

Conference	IEEE International Symposium on Information Theory 2017
Abbreviated title	ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17
Internet address	https://ieeexplore.ieee.org/xpl/conhome/7999336/proceeding (Proceedings)

Access to Document

10.1109/ISIT.2017.8006989

Cite this

@inproceedings{1095ae56fb6a4760b8ff3c2e62e16671,

title = "Golden-coded index coding",

abstract = "We study the problem of constructing good spacetime codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 × 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.",

author = "Yu-Chih Huang and Yi Hong and Emanuele Viterbo",

year = "2017",

doi = "10.1109/ISIT.2017.8006989",

language = "English",

isbn = "9781509040971",

pages = "2548–2552",

editor = "Bossert, {Martin } and Hanly, {Stephen } and Brink, {Stephan ten } and Ulukus, {Sennur }",

booktitle = "2017 IEEE International Symposium on Information Theory (ISIT 2017)",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

note = "IEEE International Symposium on Information Theory 2017, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

url = "https://ieeexplore.ieee.org/xpl/conhome/7999336/proceeding",

}

Huang, Y-C, Hong, Y & Viterbo, E 2017, Golden-coded index coding. in M Bossert, S Hanly, ST Brink & S Ulukus (eds), 2017 IEEE International Symposium on Information Theory (ISIT 2017). IEEE, Institute of Electrical and Electronics Engineers, Piscataway NJ USA, pp. 2548–2552, IEEE International Symposium on Information Theory 2017, Aachen, North Rhine-Westphalia, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006989

Golden-coded index coding. / Huang, Yu-Chih; Hong, Yi ; Viterbo, Emanuele.
2017 IEEE International Symposium on Information Theory (ISIT 2017). ed. / Martin Bossert; Stephen Hanly; Stephan ten Brink; Sennur Ulukus. Piscataway NJ USA: IEEE, Institute of Electrical and Electronics Engineers, 2017. p. 2548–2552.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Golden-coded index coding

AU - Huang, Yu-Chih

AU - Hong, Yi

AU - Viterbo, Emanuele

PY - 2017

Y1 - 2017

N2 - We study the problem of constructing good spacetime codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 × 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.

AB - We study the problem of constructing good spacetime codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 × 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.

U2 - 10.1109/ISIT.2017.8006989

DO - 10.1109/ISIT.2017.8006989

M3 - Conference Paper

SN - 9781509040971

SP - 2548

EP - 2552

BT - 2017 IEEE International Symposium on Information Theory (ISIT 2017)

A2 - Bossert, Martin

A2 - Hanly, Stephen

A2 - Brink, Stephan ten

A2 - Ulukus, Sennur

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - Piscataway NJ USA

T2 - IEEE International Symposium on Information Theory 2017

Y2 - 25 June 2017 through 30 June 2017

ER -