Golden-Coded Index Coding

Yu-Chih Huang*, Yi Hong, Emanuele Viterbo

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We study the problem of constructing good space-time codes for broadcasting K independent messages over a MEMO 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 x 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)
PublisherIEEE
Pages2548-2552
Number of pages5
StatePublished - 2017
EventIEEE International Symposium on Information Theory (ISIT) - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT)
CountryGermany
CityAachen
Period25/06/1730/06/17

Keywords

  • Lattice codes
  • index coding
  • broadcast channels
  • side information
  • space-time codes
  • IMMO
  • MODULATION

Cite this

Huang, Y-C., Hong, Y., & Viterbo, E. (2017). Golden-Coded Index Coding. In 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (pp. 2548-2552). (IEEE International Symposium on Information Theory). IEEE.