Zero vs. ε Error in Interference Channels

被引:0
作者
Levi, I. [1 ]
Vilenchik, D. [2 ]
Langberg, M. [1 ]
Effros, M. [3 ]
机构
[1] Open Univ Israel, Raanana, Israel
[2] Weizmann Inst Sci, Rehovot, Israel
[3] CALTECH, Pasadena, CA 91125 USA
来源
2013 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2013年
基金
美国国家科学基金会;
关键词
NETWORK; MULTICAST; PAIRS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:5
相关论文
共 17 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]   ON THE OPTIMAL STRUCTURE OF RECOVERING SET PAIRS IN LATTICES - THE SANDGLASS CONJECTURE [J].
AHLSWEDE, R ;
SIMONYI, G .
DISCRETE MATHEMATICS, 1994, 128 (1-3) :389-394
[3]  
[Anonymous], INF THEOR APPL WORKS
[4]   On capacity regions of non-multicast networks [J].
Chan, Terence ;
Grant, Alex .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :2378-2382
[5]  
Effros M., 2012, EQUIVALENCE NE UNPUB
[6]  
Ho T., 2010, 48 ANN ALL C COMM CO
[7]   A random linear network coding approach to multicast [J].
Ho, Tracey ;
Medard, Muriel ;
Koetter, Ralf ;
Karger, David R. ;
Effros, Michelle ;
Shi, Jun ;
Leong, Ben .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (10) :4413-4430
[8]   CANCELLATIVE PAIRS OF FAMILIES OF SETS [J].
HOLZMAN, R ;
KORNER, J .
EUROPEAN JOURNAL OF COMBINATORICS, 1995, 16 (03) :263-266
[9]   Polynomial time algorithms for multicast network code construction [J].
Jaggi, S ;
Sanders, P ;
Chou, PA ;
Effros, M ;
Egner, S ;
Jain, K ;
Tolhuizen, LMGA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :1973-1982
[10]   An algebraic approach to network coding [J].
Koetter, R ;
Médard, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (05) :782-795