Title :
Linear codes for network information flow
Author :
Li, S. -Y Robert ; Yeung, Raymond W.
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong
Abstract :
Network information flow was recently introduced by Ahlswede et al. They studied the single-source problem. Their work revealed that it is in general not optimal to consider the information to be multicast in a network as a “fluid” which can simply be routed or replicated. Rather, by employing coding at the nodes, bandwidth can in general be saved. In this paper, we present a linear coding scheme for the single-source problem studied by Ahlswede et al. Such a coding scheme is specified by a linear-code multicast
Keywords :
information theory; linear codes; multicast communication; linear codes; linear coding scheme; linear-code multicast; network information flow; single-source problem; Bandwidth; Communication networks; Councils; Linear code; Routing; Vectors;
Conference_Titel :
Information Theory and Networking Workshop, 1999
Conference_Location :
Metsovo
Print_ISBN :
0-7803-5954-2
DOI :
10.1109/ITNW.1999.814335
