Code construction for multiple sources network coding
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Rate regions for coherent and noncoherent multisource network error correction
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the capacity of non-coherent network coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
P-coding: secure network coding against eavesdropping attacks
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Multiple-Access Network Information-Flow and Correction Codes
IEEE Transactions on Information Theory
Universal Secure Network Coding via Rank-Metric Codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper investigates the problem of constructing a secret error-correcting multisource network coding scheme against an adversary that can re-select the μ tapping links in different time slice and inject z erroneous packets into network, and the network suffers from 驴 packet erasures. In our network scenario, multiple sources transmit information to one or more receivers and these receivers request the information from all the sources. Firstly, a necessary condition is derived for keeping the transmitted information from multisource nodes are secret from the eavesdropper, while the network is only subject to the eavesdropping attack. Subsequently, we provide two multisource network coding schemes for error and erasure correction which can decode the transmitted information correctly. After that, a secret and reliable multisource network coding is proposed. This scheme can retrieve the original information secretly and accurately from the corrupt and deficient information. Meanwhile, it can obtain an asymptotic achievable rate of k 驴 2z 驴 驴 驴 3μ. Moreover, the intermediate nodes are oblivious to the concrete encoding and decoding algorithms implement in source and destination nodes. Finally, security and performance analyses illustrate the advantages of our proposed scheme.