On the throughput improvement due to limited complexity processing at relay nodes
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1081-1085
- https://doi.org/10.1109/isit.2005.1523506
Abstract
We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphsKeywords
This publication has 4 references indexed in Scilit:
- Network information flow: limits and achievabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- Network information flowIEEE Transactions on Information Theory, 2000
- The capacity of binary channels that use linear codes and decodersIEEE Transactions on Information Theory, 1998