Nonlinear network coding is necessary to combat General Byzantine attacks

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 593-599

  Kosut, Oliver ^a   Tong, Lang ^a,b   Tse, David ^a,b  

^a Department of Molecular Biology and Genetics   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CODES; LINEAR CONSTRAINTS; NETWORK CODING; REAL ARITHMETIC; RELIABLE COMMUNICATION; UPPER BOUND;

INFORMATION THEORY;

EID: 77949601386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394912     Document Type: Conference Paper

References (7)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, pp. 1204-1216, 2000.
2. L. Lamport, R. Shostak, and M. Pease, "The byzantine generals problem," ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382-401, 1982.
3. D. Dolev, "The Byzantine generals strike again," Journal of Algorithms, vol. 3, no. 1, pp. 14-30, 1982.
4. N. Cai and R. W. Yeung, "Network error correction, part I: Basic concepts and upper bounds," Comm. in Inf. and Syst., vol. 6, no. 1, pp 19-36, 2006.
5. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Comm. in Inf. and Syst., vol. 6, no. 1, pp 37-54, 2006.
6. S. Jaggi, et al, "Resilient Network Coding in the Presence of Byzantine Adversaries," in Proc. INFOCOM, pp. 616-624, 2007.
7. G. Liang and N. H. Vaidya, "When WatchDog Meets Coding," Technical Report, May 2009.