2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | N.5.3 | ||
| Paper Title | Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle | ||
| Authors | Lawrence Ong, The University of Newcastle, Australia; Badri N. Vellambi, University of Cincinnati, United States | ||
| Session | N.5: Index Coding | ||
| Presentation | Lecture | ||
| Track | Networking and Network Coding | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | An equivalence was shown between network coding and index coding. The equivalence allows for a network code for any given network-coding instance to be translated to an index code for a suitably constructed index-coding instance, and vice versa. The equivalence also holds for the opposite direction. A secure version of the equivalence in the presence of eavesdroppers was proven for the case where there is no decoding error and no information leakage to the eavesdroppers. For the case of non-zero decoding error and non-zero leakage, three out of the four directions required for an equivalence were proven. This paper proves the last direction, thereby completing the equivalence between secure network coding and secure index coding. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
