Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage

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.

[1]  Abbas El Gamal,et al.  Network Information Theory: Preface , 2011 .

[2]  Jörg Kliewer,et al.  An Equivalence between Secure Network and Index Coding , 2017, 2016 IEEE Globecom Workshops (GC Wkshps).

[3]  Ning Cai,et al.  Secure Network Coding on a Wiretap Network , 2011, IEEE Transactions on Information Theory.

[4]  T. Chan,et al.  Capacity bounds for secure network coding , 2008, 2008 Australian Communications Theory Workshop.

[5]  Jörg Kliewer,et al.  A Code Equivalence between Secure Network and Index Coding , 2018, ArXiv.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Yeow Meng Chee,et al.  On the Security of Index Coding With Side Information , 2011, IEEE Transactions on Information Theory.

[8]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2015, IEEE Trans. Inf. Theory.

[9]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[10]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.