会议专题

Construction of Network Error Correction Codes in Packet Networks

Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. Following the research line using the extended global encoding kernels proposed in 8, we give a constructive proof of the attainability of this bound and indicate that the required field size for the existence of network maximum distance separable (MDS) codes can become smaller further. By this proof, an algorithm is proposed to construct general linear network error correction codes including the linear network error correction MDS codes.

Xuan Guang Fang-Wei Fu Zhen Zhang

Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, P.R.China Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA

国际会议

2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)

北京

英文

1-6

2011-07-25(万方平台首次上网日期,不代表论文的发表时间)