2010/01/21 by Hongyi Yao, Yao, Hongyi, Danilo Silva +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Networking and Internet Architecture (cs.NI) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1001.3714
openalex publication_date 2010/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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