Journal ArticleDOI
Network information flow
TLDR
This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.Abstract:
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.read more
Citations
More filters
Journal ArticleDOI
Cooperative Protocol for Analog Network Coding in Distributed Wireless Networks
TL;DR: This paper considers a system with cooperative relaying of overlapped transmissions from two independent users, and explores the case that network nodes may allow the transmitted signals to interfere both at the final destination node, and also at an intermediate node that acts subsequently as a relay.
Proceedings ArticleDOI
Adaptive Modulation and Network Coding with Optimized Precoding in Two-Way Relaying
TL;DR: A novel scheme termed adaptive modulation and network coding (AMNC), which jointly optimizes modulations and network coded based on the CSI is introduced, which can offer a significant improvement of achievable throughput for two-way relaying.
Journal ArticleDOI
Network codes resilient to jamming and eavesdropping
TL;DR: In this article, the authors considered the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors, and they provided polynomial-time distributed network codes that are information-theoretically rate-optimal for this scenario.
Journal ArticleDOI
Cross-Layer Design for Downlink Multihop Cloud Radio Access Networks With Network Coding
Liang Liu,Wei Yu +1 more
TL;DR: In a C-RAN model where theRRHs are connected to the CP via multihop routers, data-sharing can be superior to compression if the network coding technique is adopted for multicasting user messages to the cooperating RRHs, and the RRH's beamforming vectors are jointly optimized based on the techniques of sparse optimization and successive convex approximation.
Journal ArticleDOI
Feedback-Based Online Network Coding
TL;DR: In this article, the impact of feedback on sender-side queue size and receiver-side decoding delay is studied in an asymptotic sense as the traffic load approaches capacity, including an order-sensitive notion, which assumes that packets are useful only when delivered in order.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Journal ArticleDOI
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Journal ArticleDOI
Achievable rates for multiple descriptions
Abbas El Gamal,Thomas M. Cover +1 more
TL;DR: These rates are shown to be optimal for deterministic distortion measures for random variables and Shannon mutual information.