Secret and reliable coding mechanism for noncoherent multisource network coding

This work considers the communication scenario where multiple sources transmit information to one or more receivers and these receivers request the information from all the sources. We construct a secret and reliable coding mechanism for noncoherent multisource network coding by extending the work to multisource case. Although the network scenario suffers from an adversary that can re-select the μ tapping links in different time slot and inject z erroneous packets into network, and the transmission links suffer from a ρ packet erasures, our scheme can retrieve the original information secretly and accurately from the corrupt and deficient information. Meanwhile, the secret and reliable multisource network coding scheme can obtain an asymptotic achievable rate of ^k-2z-ρ-3μ.