A code and rate equivalence between secure network and index coding

Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding instance, for which a code for one instance can be translated to a code for the other instance with the same decoding-error performance. The equivalence also showed a surprising result that any network-coding instance can be mapped to an index-coding instance with a properly designed code translation. In this article, we extend the existing equivalence (instance map and code translation) to one between secure index coding and secure network coding, where eavesdroppers are present in the network. In the secure setting, any code construction needs to guarantee security constraints in addition to decoding-error performance. A rate equivalence between these two problems is also established.

Original languageEnglish (US)
Article number9336652
Pages (from-to)106-120
Number of pages15
JournalIEEE Journal on Selected Areas in Information Theory
Issue number1
StatePublished - Mar 2021

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Media Technology
  • Artificial Intelligence
  • Applied Mathematics


  • Code equivalence
  • Index coding
  • Network coding
  • Secure communications
  • Wiretap


Dive into the research topics of 'A code and rate equivalence between secure network and index coding'. Together they form a unique fingerprint.

Cite this