Error Correction for Index Coding With Side Information

A problem of index coding with side information was first considered by Birk and Kol in 1998. In this study, a generalization of index coding scheme, where transmitted symbols are subject to errors, is studied. Error-correcting methods for such a scheme, and their parameters, are investigated. In particular, the following question is discussed: given the side information hypergraph of index coding scheme and the maximal number of erroneous symbols δ , what is the shortest length of a linear index code, such that every receiver is able to recover the required information? This question turns out to be a generalization of the problem of finding a shortest length error-correcting code with a prescribed error-correcting capability in the classical coding theory. The Singleton bound and two other bounds, referred to as the α-bound and the κ -bound, for the optimal length of a linear error-correcting index code (ECIC) are established. For large alphabets, a construction based on concatenation of an optimal index code with a maximum distance separable classical code is shown to attain the Singleton bound. For smaller alphabets, however, this construction may not be optimal. A random construction is also analyzed. It yields another inexplicit bound on the length of an optimal linear ECIC. Further, the problem of error-correcting decoding by a linear ECIC is studied. It is shown that in order to decode correctly the desired symbol, the decoder is required to find one of the vectors, belonging to an affine space containing the actual error vector. The syndrome decoding is shown to produce the correct output if the weight of the error pattern is less or equal to the error-correcting capability of the corresponding ECIC. Finally, the notion of static ECIC, which is suitable for use with a family of instances of an index coding problem, is introduced. Several bounds on the length of static ECICs are derived, and constructions for static ECICs are discussed. Connections of these codes to weakly resilient Boolean functions are established.

[1]  P. Sarkar,et al.  Improved construction of nonlinear resilient S-boxes , 2002, IEEE Transactions on Information Theory.

[2]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[4]  Femke Bekius,et al.  The Shannon Capacity of a Graph , 2011 .

[5]  Yunnan Wu,et al.  The Local Mixing Problem , 2006 .

[6]  Muriel Médard,et al.  Symbol-level network coding for wireless mesh networks , 2008, SIGCOMM '08.

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

[8]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

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

[10]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[11]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[12]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[13]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[14]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, FOCS.

[15]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[16]  Yitzhak Birk,et al.  Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[17]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[18]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[19]  René Peeters.  On thep-ranks of net graphs , 1995, Des. Codes Cryptogr..

[20]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[21]  René Peeters.  Uniqueness of strongly regular graphs having minimal p-rank , 1995 .

[22]  René Peeters,et al.  Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..

[23]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[24]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

[25]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[26]  Claude Carlet,et al.  Vectorial Boolean Functions for Cryptography , 2006 .

[27]  Alexander Sprintson,et al.  On the relation between the Index Coding and the Network Coding problems , 2008, 2008 IEEE International Symposium on Information Theory.