Secrecy and reliability using Raptor codes in the presence of a wiretapper in a multiple path wireless network

We consider a multiple path wireless network and address the problem of coding and routing a message in a manner that guarantees both robustness and security. Each path in the network is assumed to be a wiretap channel that includes both a main channel and a wiretap monitored by an eavesdropper. We then show that Raptor codes can be used to achieve both perfect secrecy and zero error probability. This work is an extension of recent work by Thangaraj, Dihidar, Calderbank, McLaughlin, and Merolla in which they show the efficacy of using LDPC codes for similar purposes over a wiretap channel. We show how to simultaneously construct the parameters of the code and robustly route the codeword while minimizing information flow to the adversary.