×
Ahlswede, Rudolf; Cai, Ning; Li, Shuo-Yen Robert; Yeung, Raymond W.

Network information flow. (English) Zbl 0991.90015

IEEE Trans. Inf. Theory 46, No. 4, 1204-1216 (2000).

Cited in 6 Reviews
Cited in 130 Documents

MSC:

90B18 Communication networks in operations research
94A05 Communication theory
94A29 Source coding
94C15 Applications of graph theory to circuits and networks
68M10 Network design and communication in computer systems

Keywords:

diversity coding; multicast; network coding; switching; multiterminal source coding
PDF BibTeX XML Cite
\textit{R. Ahlswede} et al., IEEE Trans. Inf. Theory 46, No. 4, 1204--1216 (2000; Zbl 0991.90015)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Ahlswede R, Cai N, Li S-Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204-1216 · Zbl 0991.90015
[2] Ho T, Médard M, Koetter R, et al. A random linear network coding approach to multicast. IEEE Trans Inf Theory, 2006, 52: 4413-4430 · Zbl 1323.94010
[3] Li S-Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371-381 · Zbl 1063.94004
[4] Yeung R W. Information Theory and Network Coding. Hong Kong: Springer, 2008 · Zbl 1154.94001
[5] Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory, 2003, 51: 1973-1982 · Zbl 1288.94098
[6] Koetter R, Médard M. An algebraic approach to network coding. IEEE/ACM Trans Network, 2003, 11: 782-795
[7] Lima L, Médard M, Barros J. Random linear network coding: A free cypher? In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 546-550
[8] Cai N, Yeung R W. Secure network coding. In: ISIT, Switzerland, 2002. 323 · Zbl 1366.94442
[9] Cai N, Yeung R W. A security condition for multi-source linear network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 24-29
[10] Yeung R W, Cai N. On the optimality of a construction of secure network codes. In: Proc of the IEEE Inter Sym on Infor Theory, Toronto, 2008. 166-170
[11] Feldman J, Malkin T, Servedio R A, et al. On the capacity of secure network coding. In: 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2004. 388-401
[12] Bhattad K, Narayanan K. Weakly secure network coding. In: Proc of the First Workshop on Network Coding, Theory, and Applications (NetCod), Riva del, 2005. 148-153
[13] Tan J, Médard M. Secure network coding with a cost criterion. In: Proc of the 4th Inter Sym on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt’06), Boston, 2006. 1-6
[14] Vilela J P, Lima L, Barros J. Lightweight security for network coding. In: IEEE Inter Conference on Communications, Beijing, 2008. 1750-1754
[15] Lima L, Vilela J P, Barros J, et al. An information-theoretic cryptanalysis of network coding is protecting the code enough? In: ISITA, Auckland, 2008. 1-6
[16] Koetter R, Kschischang F. Coding for errors and erasures in random network coding. IEEE Trans Inf Theory, 2008, 54: 3579-3591 · Zbl 1318.94111
[17] Silva D, Kschischang F, Koetter R. A rank-metric approach to error control in random network coding. In: IEEE Inf Theory Workshop on Infor Theory for Wireless Networks, Tucson, 2007. 1-5 · Zbl 1318.94119
[18] Jaggi S, Langberg M, Katti S, et al. Resilient network coding in the presence of byzantine adversaries. IEEE Trans Inf Theory, 2008, 54: 2596-2603 · Zbl 1328.94105
[19] Cai N, Yeung R W. Network coding and error ecorrection. In: Proc 2002 IEEE Inform. Bangalore, Theory Workshop, 2002. 323
[20] Yeung R W, Cai N. Network error correction, I: basic concepts and upper bounds. Commun Inf Syst, 2006, 6: 19-35 · Zbl 1161.94452
[21] Zhang Z. Linear network error correction coding in packet networks. IEEE Trans Inf Theory, 2008, 54: 209-218 · Zbl 1308.94116
[22] Ho T, Leong B, Koetter R, et al. Byzantine modification detection in multicast networks using randomized network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Chicago, 2004. 144 · Zbl 1328.94076
[23] Charles D, Jain K, Lauter K. Signatures for network coding. In: Proc of the 40th ACISS, Princeton, 2006. 857-863 · Zbl 1207.94050
[24] Zhao F, Kalker T, Médard M, et al. Signatures for content distribution with network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice, 2007. 556-560
[25] Boneh D, Freeman D, Katz J, et al. Signing a linear subspace: signature schemes for network coding. In: Proc of PKC, Irvine, CA, 2009. 68-87 · Zbl 1227.68024
[26] Stinson D R. Something about all or nothing (transforms). Designs Codes Cryptography, 2001, 22: 133-138 · Zbl 0985.94030
[27] Rivest R L. All-or-nothing Encryption and the package transform. In: Biham E, ed. Fast Software Encryption 1997 (LNCS 1267). Berlin: Springer, 1997. 210-218 · Zbl 1385.94067
[28] West D B. Introduction to Graph Theory. 2nd ed. Upper Saddle River, · Zbl 0845.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.