Network information flow
From MaRDI portal
Publication:4501758
DOI10.1109/18.850663zbMath0991.90015WikidataQ56699666 ScholiaQ56699666MaRDI QIDQ4501758
Raymond W. Yeung, Rudolf Ahlswede, Shuo-Yen Robert Li, Ning Cai
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850663
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
94C15: Applications of graph theory to circuits and networks
94A05: Communication theory
94A29: Source coding
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Signatures for network coding
- Network error correction. I: Basic concepts and upper bounds
- Polynomial Time Algorithms for Multicast Network Code Construction
- A Random Linear Network Coding Approach to Multicast
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Linear Network Error Correction Codes in Packet Networks
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Network information flow
- All-or-nothing encryption and the package transform
- Linear network coding
- Secure Network Coding on a Wiretap Network
- Something about all or nothing (transforms)