|
|
- 2018
最大距离可分码在网络编码纠错中的应用
|
Abstract:
摘要： 在网络编码中,由于网络的所有中间节点都会对上游消息进行重新组合,所以很少的错误也有可能扩散至整个网络而造成信宿节点译码失败。针对该问题,提出一种简单的网络编码纠错方案。该方案在信源处利用一个已有的最大距离可分码的生成矩阵G将k个消息编码成n个消息(k
Abstract: In network coding, for the intermediate nodes will combine the received messages, it is potential that a small number of errors will be spread over all the network. This will make the sinks fail to decode the original messages. Aiming at this problem, a simple scheme for network error-correction codes(NEC)is proposed. In the source, the generating matrix G of a known MDS(maximum distance separable)code is adopted to code k messages to n messages. The n messages will be transmitted through the network with network coding scheme. We can simply take a common network coding algorithm, which is determined or random, to construct this NEC. It is no need to consider the error spread issue. The coding finite field for all the nodes is Q, while the coefficients of local coding kernel in network coding are selected from the finite filed q. The simulation shows that, even if Q is not bigger than q, it is also a high probability that NEC will maintain its MDS characteristics
| [1] | YANG S, YEUNG R W, CHI K N. Refined coding bounds and code constructions for coherent network error correction[J]. IEEE Transactions on Information Theory, 2009, 57(3):1409-1424. |
| [2] | XUAN G, FU F W, ZHANG Z. Construction of network error correction codes in packet networks[C] // International Symposium on NETWORKING Coding. Chamonix: IEEE, 2011:1-6. |
| [3] | ZHANG Z. Linear network error correction codes in packet networks[J]. IEEE Transactions on Information Theory, 2008, 54(1):209-218. |
| [4] | GABIDULIN è M. Theory of codes with maximum rank distance[J]. Problems of Information Transmission, 1985, 21(1):3-16. |
| [5] | KOETTER R, KSCHISCHANG F R. Coding for errors and erasures in random network coding[J]. IEEE Transactions on Information Theory, 2008, 54(8):3579-3591. |
| [6] | MATSUMOTO R. Construction algorithm for network error-correcting codes attaining the Singleton bound[J]. Ieice Transactions on Fundamentals of Electronics Communications & Computer Sciences, 2007, 90(9):1729-1735. |
| [7] | BAHRAMGIRI H, LAHOUTI F. Robust network coding against path failures[J]. Communications Iet, 2010, 4(3):272-284. |
| [8] | SILVA D, KSCHISCHANG F R. Using rank-metric codes for error correction in random network coding[C] // IEEE International Symposium on Information Theory. Nice: IEEE, 2007:796-800. |
| [9] | SILVA D, KSCHISCHANG F R, KOETTER R. A rank-metric approach to error control in random network coding[J]. IEEE Transactions on Information Theory, 2008, 54(9):3951-3967. |
