Network information flow
- R. Ahlswede, N. Cai, S. Li, R. Yeung
- Computer ScienceIEEE Transactions on Information Theory
- 1 July 2000
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.
Linear network coding
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.
Information Theory and Network Coding
- R. Yeung
- Computer Science
- 10 September 2008
This book contains a thorough discussion of the classical topics in information theory together with the first comprehensive treatment of network coding, a subject first emerged under information…
On characterization of entropy function via information inequalities
- Zhen Zhang, R. Yeung
- Computer Science, PhysicsProceedings. IEEE International Symposium on…
- 1 July 1998
The main discovery is a new information inequality involving 4 discrete random variables which gives a negative answer to this fundamental problem of information theory.
A First Course in Information Theory
- R. Yeung
- Computer Science
- 2002
This book provides the first comprehensive treatment of the theory of I-Measure, network coding theory, Shannon and non-Shannon type information inequalities, and a relation between entropy and group theory.
On a relation between information inequalities and group theory
A one-to-one correspondence between information inequalities and group inequalities is established and it is established that information inequalities can be proved by proving the corresponding group inequalities, and vice versa.
Secure Network Coding on a Wiretap Network
This paper proposes a model, call the wiretap network, that incorporates information security with network coding, and presents a construction of secure linear network codes that can be used provided a certain graph-theoretic condition is satisfied.
A new outlook of Shannon's information measures
- R. Yeung
- Computer ScienceIEEE Transactions on Information Theory
- 1 May 1991
The author presents a new approach to understanding the underlying mathematical structure of Shannon's information measures, which provides answers to the following two questions for any finite…
Network Error Correction, I: Basic Concepts and Upper Bounds
inspired by network coding, a new paradigm called network error correction is introduced and the basic concepts and the network generalizations of the Hamming bound and the Singleton bound are discussed.
A non-Shannon-type conditional inequality of information quantities
- Zhen Zhang, R. Yeung
- Computer Science, PhysicsIEEE Transactions on Information Theory
- 1 November 1997
For four random variables, this work has discovered a conditional inequality which is not implied by the basic information inequalities of the same set of random variables.
...
...