Network information flow: Limits and achievability

被引：20
作者：
Borade, SP [1 ]
机构：
[1] Indian Inst Technol, Dept Elect Engn, Bombay 400076, Maharashtra, India
来源：
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/ISIT.2002.1023411
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An information theoretic upper bound on the information flow in discrete memoryless networks is found. The networks considered here can have multiple information sources and multiple sinks corresponding to each of the sources (which is also called as multicast). In the special case of networks with a single information source with multiple sinks, the bound coincides with the achievable region given in [1], and thus proves the optimality of the coding scheme proposed in it.
引用
收藏
页码：139 / 139
页数：1
相关论文
共 5 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[3]  
GARG N, 1994, THESIS IIT
[4]  
NAGAMOCHI H, 1988, THESIS KYOTO U JAPAN
[5]   On point-to-point communication networks [J].
Song, LH ;
Yeung, RW .
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, :21-21
1