Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
Error and erasure correcting algorithms for rank codes
Designs, Codes and Cryptography
Secure network coding for wireless mesh networks: Threats, challenges, and directions
Computer Communications
A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Protection against link errors and failures using network coding in overlay networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Compressed network coding vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Network coding-based protection strategy against node failures
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Improved compression of network coding vectors using erasure decoding and list decoding
IEEE Communications Letters
Communication over finite-field matrix channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Towards Fault-Tolerant Fine-Grained Data Access Control for Smart Grid
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The error control of random network coding has recently received a lot of attention because its solution can increase robustness and reliability of data transmission. To achieve this, additional overhead is needed for error correction. In this paper, we design a compressed error and erasure correcting scheme to decrease the additional overhead of error correction. This scheme reduces the computation overhead dramatically by employing an efficient algorithm to detect and delete linearly dependent received packets in the destination node. It also simplifies the hardware operations when the scheme reduces the received matrix Y to form Ek(Y) instead of E(Y) in the decoding process. If at most r original packets get combined in k packets of one batch, the payload of one packet can increase from M − k to M − O(rlog qk) for the application of compressed code, where M is the packet length. In particular, the decoding complexity of compressed code is O(rm) operations in an extension field , which does not enhance the overall decoding complexity of the system. Finally, we also compare our scheme's performance with existing works. The numerical results and analyses illustrate the security and performance of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.