A separation theorem for single-source network coding

被引:33
作者
Song, LH [1 ]
Yeung, RW [1 ]
Cai, N [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China
关键词
channel coding; feedback; network coding; separation theorem;
D O I
10.1109/TIT.2006.872983
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider a point-to-point communication network of discrete memoryless channels. In the network, there are a source node and possibly more than one sink node. Information is generated at the source node and is multicast to each sink node. We allow a node to encode its received information before loading it onto an outgoing channel, where the channels are independent of each other. We also allow the nodes to pass along messages asynchronously. In this paper, we characterize the admissibility of single-source multi-sink communication networks. Our result can be regarded as a network generalization of Shannon's result that feedback does not increase the capacity of a discrete memoryless channels (DMCs), and it implies a separation theorem for network coding and channel coding in such a communication network.
引用
收藏
页码:1861 / 1871
页数:11
相关论文
共 29 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Ahlswede R., 1971, P 2 INT S INF THEOR, P23
[3]  
[Anonymous], 1990, P INT S INF THEOR IT
[4]   Network information flow: Limits and achievability [J].
Borade, SP .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :139-139
[5]   BROADCAST CHANNELS [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) :2-+
[6]   AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACK [J].
COVER, TM ;
LEUNG, CSK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) :292-298
[7]   ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :399-404
[8]  
Cover TM, 2006, Elements of Information Theory
[9]  
Csiszar I., 1981, INFORM THEORY CODING
[10]  
Ford L. R, 1962, FLOWS NETWORKS