Computer Science – Networking and Internet Architecture
Scientific paper
2010-01-21
Computer Science
Networking and Internet Architecture
6 pages, to appear at IEEE NetCod 2010
Scientific paper
We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We provide polynomial-time, rate-optimal distributed network codes for this scenario, improving on the rates achievable in previous work. Our main contribution shows that as long as the sum of the adversary's jamming rate Zo and his eavesdropping rate Zi is less than the network capacity C, (i.e., Zo+Zi
Jaggi Sidharth
Langberg Michael
Silva Danilo
Yao Hongyi
No associations
LandOfFree
Network Codes Resilient to Jamming and Eavesdropping does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Network Codes Resilient to Jamming and Eavesdropping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network Codes Resilient to Jamming and Eavesdropping will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248691