Network Coding: An Introduction
Network coding promises to significantly impact the way communications networks are designed, operated, and understood. This book presents a unified and intuitive overview of the theory, applications, challenges, and future directions of this emerging field, and is a must-have resource for those working in wireline or wireless networking. • Uses an engineering approach - explains the ideas and practical techniques • Covers mathematical underpinnings, practical algorithms, code selection, security, and network management • Discusses key topics of inter-session (non-multicast) network coding, lossy networks, lossless networks, and subgraph-selection algorithms Starting with basic concepts, models, and theory, then covering a core subset of results with full proofs, Ho and Lun provide an authoritative introduction to network coding that supplies both the background to support research and the practical considerations for designing coded networks. This is an essential resource for graduate students and researchers in electronic and computer engineering and for practitioners in the communications industry.
What people are saying - Write a review
We haven't found any reviews in the usual places.
InterSession Network Coding
Network Coding in Lossy Networks
5 Subgraph Selection
6 Security Against Adversarial Errors
Other editions - View all
acyclic network algorithm approach auxiliary encoding vector batch capacity coded packet coding coefficients coding operations coding subgraph coding vector columns consider construct convex convex combination corresponding defined delay-free denote distributed equation erasure coding error error-correcting codes finite field flow function given graph information theory innovative packets inter-session coding intra-session Lemma linear coding linear network coding linearly independent lossless matroid minimum cut multicast network coding multicast problem network coding problem nonzero packet injections packet networks packet transmitted packets received path polynomial probability Proof queue-length-based random linear network random network coding random variables received by node received packets satisfying scalar linear network Section session sink nodes slot slotted Aloha source node source packets source processes subgradient method subgraph selection subset tandem network Theorem throughput topological order unicast unicast connection values vector linear vector space virtual queue virtual transmissions wireless networks
Page 6 - K. Jain, J. Padhye, VN Padmanabhan, and L. Qiu, "Impact of interference on multi-hop wireless network performance,
Page 3 - Linear codes for sources and source networks: Error exponents, universal coding," IEEE Transactions on Information Theory, vol.
Page 11 - L. Xiao, M. Johansson, and S. Boyd, "Simultaneous routing and resource allocation via dual decomposition,
Page 2 - Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations," Mathematics of Operations Research, Vol.
Page 5 - T. Ho, M. Medard, R. Koetter, DR Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast,
Page 3 - R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Transactions on Information Theory, vol.
Page 9 - Multicast tree generation in networks with asymmetric links,