Network Codes Resilient to Jamming and Eavesdropping

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-248691

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.