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
Proceedings ArticleDOI
Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast
TL;DR: This paper investigates a more structured MAC layer coding scheme that achieves the optimum performance in the delay sensitive traffic context while achieving the same overhead level as MRNC and develops the MSNC, which transmits the packets once uncoded and employs random network coding for retransmissions.
Proceedings ArticleDOI
Multicast Multiuser ARQ
TL;DR: Overall, it is found that the throughput is significantly higher than multicast selective repeat ARQ, and that the optimal throughput for an erasure channel is attained.
Journal ArticleDOI
Mitigating Error Propagation in Two-Way Relay Channels with Network Coding
TL;DR: This work investigates the application of a reliability threshold at the relay nodes to a network-coded two-way relay channel where the relay is assisting two sources simultaneously and considers the performance of the proposed thresholding techniques for network-channel coded systems.
Journal ArticleDOI
CodePlay: Live Multimedia Streaming in VANETs Using Symbol-Level Network Coding
Zhenyu Yang,Ming Li,Wenjing Lou +2 more
TL;DR: CodePlay is introduced, a new LMS scheme in VANETs that fully takes advantage of SLNC through a coordinated local push mechanism, and special scheme design based on the unique characteristics ofSLNC proposed in CodePlay is necessary for future LMS applications inVANET.
Proceedings ArticleDOI
Achievable Rate Region of a Two Phase Bidirectional Relay Channel
TL;DR: The capacity region of the broadcast channel in a two phase bidirectional relay communication scenario is proved and each receiving node has perfect knowledge about the message intended for the other node.
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.