JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2018, Vol. 53 ›› Issue (1): 75-82.doi: 10.6040/j.issn.1671-9352.2.2017.325

Previous Articles     Next Articles

Application of maximum distance separable codes in the error correction of the network coding

ZHANG Guang-zhi1,2, CAI Shao-bin1*, MA Chun-hua2, ZHANG Dong-qiu2   

  1. 1. College of Computer, Harbin Engineering University, Harbin 150001, Heilongjiang, China;
    2. Department of Information Engineering, Suihua University, Suihua 152000, Heilongjiang, China
  • Received:2017-08-28 Online:2018-01-20 Published:2018-01-19

PDF (PC)

942

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.

Key words: network error-correction codes, network coding, error spread

CLC Number: 

  • TP393
[1] ZHANG Z. Linear network error correction codes in packet networks[J]. IEEE Transactions on Information Theory, 2008, 54(1):209-218.
[2] 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.
[3] 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.
[4] 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.
[5] BAHRAMGIRI H, LAHOUTI F. Robust network coding against path failures[J]. Communications Iet, 2010, 4(3):272-284.
[6] 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.
[7] 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.
[8] 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.
[9] GABIDULIN È M. Theory of codes with maximum rank distance[J]. Problems of Information Transmission, 1985, 21(1):3-16.
[1] LI Yan-ping, QI Yan-jiao, ZHANG Kai, WEI Xu-guang. Multi-authority and revocable attribute-based encryption scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(7): 75-84.
[2] LI Yang, CHENG Xiong, TONG Yan, CHEN Wei, QIN Tao, ZHANG Jian, XU Ming-di. Method for threaten users mining based on traffic statistic characteristics [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(1): 83-88.
[3] ZHAO Guang-yuan, QIN Feng-lin, GUO Xiao-dong. Design and implementation of P2P-based network measurement cloud platform [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(12): 104-110.
[4] HUANG Shu-qin, XU Yong, WANG Ping-shui. User similarity calculation method based on probabilistic matrix factorization and its recommendation application [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(11): 37-43.
[5] WANG Ya-qi, WANG Jing. Rumor spreading on dynamic complex networks with curious psychological mechanism [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(6): 99-104.
[6] CHEN Guang-rui, CHEN Xing-shu, WANG Yi-tong, GE Long. A software update mechanism for virtual machines in IaaS multi-tenant environment [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(3): 60-67.
[7] ZHUANG Zheng-mao, CHEN Xing-shu, SHAO Guo-lin, YE Xiao-ming. A time-relevant network traffic anomaly detection approach [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(3): 68-73.
[8] SONG Yuan-zhang, LI Hong-yu, CHEN Yuan, WANG Jun-jie. P2P botnet detection method based on fractal and adaptive data fusion [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(3): 74-81.
[9] ZHU Sheng, ZHOU Bin, ZHU Xiang. EIP: discovering influential bloggers by user similarity and topic timeliness [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 113-120.
[10] . An approach of detecting LDoS attacks based on the euclidean distance of available bandwidth in cloud computing [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 92-100.
[11] LI Yu-xi, WANG Kai-xuan, LIN Mu-qing, ZHOU Fu-cai. A P2P network privacy protection system based on anonymous broadcast encryption scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 84-91.
[12] SU Bin-ting, XU Li, FANG He, WANG Feng. Fast authentication mechanism based on Diffie-Hellman for wireless mesh networks [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 101-105.
[13] LIN Li. News event extraction based on kernel dependency graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 121-126.
[14] . Construction of expert relationship network based on random walk strategy [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(7): 30-34.
[15] ZHANG Wen-ya, SONG Da-wei, ZHANG Peng. An ontology-based readability model for vertical search [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(7): 23-29.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd