Golden-coded index coding

Yu-Chih Huang, Yi Hong, Emanuele Viterbo

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-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 languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory (ISIT 2017)
EditorsMartin Bossert, Stephen Hanly, Stephan ten Brink, Sennur Ulukus
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages2548–2552
Number of pages5
ISBN (Electronic)9781509040964
ISBN (Print)9781509040971
DOIs
Publication statusPublished - 2017
EventIEEE International Symposium on Information Theory 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Conference

ConferenceIEEE International Symposium on Information Theory 2017
Abbreviated titleISIT 2017
CountryGermany
CityAachen
Period25/06/1730/06/17

Cite this