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

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E90-A, Issue 9, 2007, Pages 1729-1735

  Matsumoto, Ryutaroh ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Error correction; Mds code; Network coding; Random network coding; Singleton bound

Indexed keywords

CODES (SYMBOLS); CODING ERRORS; ERROR CORRECTION; ERRORS; LINEAR NETWORKS;

CONSTRUCTION ALGORITHMS; DETERMINISTIC ALGORITHMS; INTERMEDIATE NODE; MDS CODE; RANDOM NETWORK CODING; ROBUST NETWORK; SINGLETON BOUND; TIME COMPLEXITY;

NETWORK CODING;

EID: 43249131700     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e90-a.9.1729     Document Type: Conference Paper

References (14)

1. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1206, July 2000.
2. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Communications in Information and Systems, vol. 6, no. 1, pp. 37-54, 2006.
3. K. Harada and H. Yamamoto, "Strongly secure network coding schemes with a ramp threshold," Proc. SITA 2005, vol. 2, pp. 741-744, Okinawa, Japan, Nov. 2005.
4. S. Jaggi, M. Langberb, T. Ho, and M. Effros, "Correction of adversarial errors in networks," Proc. ISIT 2005, pp. 1455-1459, Adelaide, Australia, Sept. 2005.
5. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," Proc. INFOCOMM 2007, pp. 616-624, Anchorage, Alaska, USA, May 2007.
6. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, June 2005.
7. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
8. M. Kurihara, "On some robust and secure transformations for linear network coding," IEICE Technical Report, IT2006-41, July 2006.
9. S. Lang, Linear Algebra, 3rd ed., Undergraduate Texts in Mathematics, Springer-Verlag, New York, USA, 1987.
10. S. Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
11. S. Yang, C. K. Ngai, and R. W. Yeung, "Construction of linear network codes that achieve a refined Singleton bound," Proc. ISIT 2007, pp. 1576-1580, Nice, France, June 2007.
12. S. Yang and R. W. Yeung, "Characterizations of network error correction/detection and erasure correction," Proc. NetCod 2007, UCSD, San Diego, California, USA, Jan. 2007, available from http://code.ucsd.edu/netcod07/
13. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Communications in Information and Systems, vol. 6, no. 1, pp. 19-36, 2006.
14. Z. Zhang, "Network error correction coding in packetized networks," Proc. ITW'06, Chengdu, China, pp. 433-437, Oct. 2006.