Zero vs. epsilon Error in Interference Channels

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in rate when insisting on zero error communication in the context of interference channels.

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

[2]  Ron Holzman,et al.  Cancellative pairs of families of sets , 1995, Eur. J. Comb..

[3]  Tracey Ho,et al.  On the impact of a single edge on the network coding capacity , 2011, 2011 Information Theory and Applications Workshop.

[4]  Alon Orlitsky,et al.  Zero-Error Information Theory , 1998, IEEE Trans. Inf. Theory.

[5]  Michael Langberg,et al.  Source coding for dependent sources , 2012, 2012 IEEE Information Theory Workshop.

[6]  Michael Langberg,et al.  Network coding: Is zero error always possible? , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[8]  Alex J. Grant,et al.  On capacity regions of non-multicast networks , 2010, 2010 IEEE International Symposium on Information Theory.

[9]  H. Robbins.  A Remark on Stirling’s Formula , 1955 .

[10]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[11]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[12]  Jirí Sgall,et al.  Bounds on Pairs of Families with Restricted Intersections , 1999, Comb..