Construction algorithm for network error-correcting codes attaining the singleton bound

被引：27
|
作者：
Matsumoto, Ryutaroh [1 ]
机构：
[1] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 1528550, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2007年 / E90A卷 / 09期
关键词：
error correction; MDS code; network coding; random network coding; Singleton bound;
D O I：
10.1093/ietfec/e90-a.9.1729
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give a centralized deterministic algorithm for constructing linear network error-correcting codes that attain the Singleton bound of network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We give estimates on the time complexity and the required symbol size of the proposed algorithm. We also estimate the probability of a random choice of local encoding vectors by all intermediate nodes giving a network error-correcting codes attaining the Singleton bound. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.
引用
收藏
页码：1729 / 1735
页数：7
相关论文
共 50 条
12345