A linear code equivalence between index coding and network coding was shown by El Rouayheb et al., which establishes that for any index-coding instance, there exists a network-coding instance for which any index code can be mapped to a suitable network code, and vice versa. Similarly, for any network-coding instance, there exists an index-coding instance for which a similar code equivalence can be constructed. Effros et al. extended the equivalence to include non-linear codes. Subsequently, we extended the code equivalence to the secure communication setting in the presence of an eavesdropper, in which we impose perfect decodability and secrecy. In this paper,
we generalise the equivalence between secure index coding and secure network coding to include non-zero decoding error and non-zero leakage.
Funding
ARC
FT140100219
History
Source title
Proceedings of the 2018 IEEE International Symposium on Information Theory
Name of conference
2018 IEEE International Symposium on Information Theory (ISIT)
Location
Vail, CO
Start date
2018-06-17
End date
2018-06-22
Pagination
841-845
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Place published
Piscataway, NJ
Language
en, English
College/Research Centre
Faculty of Engineering and Built Environment
School
School of Electrical Engineering and Computer Science