Coding for errors and erasures in random network coding

IEEE Transactions on Information Theory

Volumn 54, Issue 8, 2008, Pages 3579-3591

  Köetter, Ralf ^a   Kschischang, Frank R ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Accidents; Aerospace electronics; Algorithm design and analysis; Capacity planning; Computers; Decoding; Delay; Encoding; Error correction; Error correction codes; Extraterrestrial measurements; Finite element methods; Galois fields; Geometry; Heart; Hypercubes; Information theory; Jamming; Knowledge engineering; Manifolds; Network coding; Network error correction; Network topology; Noise; Object recognition; Protocols; Receivers; Stochastic processes; Strontium; Subspace metric; Terminology; Transmitters; Upper bound; Vectors

Indexed keywords

CANNING; CODES (STANDARDS); CODES (SYMBOLS); CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; INJECTION (OIL WELLS); LINEAR NETWORKS; PROGRAMMING THEORY; RANDOM ERRORS; SPHERES;

ACCIDENTS; AEROSPACE ELECTRONICS; ALGORITHM DESIGN AND ANALYSIS; CAPACITY PLANNING; CHANNEL TRANSFER; CODE CONSTRUCTIONS; CODE WORDS; COMPUTERS; DELAY; ENCODING; ERROR CORRECTION; ERROR CORRECTION CODES; ERROR-CONTROL; EXTRATERRESTRIAL MEASUREMENTS; FINITE ELEMENT METHODS; GALOIS FIELDS; GEOMETRY; GRASSMANN GRAPHS; GRASSMANNIAN; HEART; HYPERCUBES; INFORMATION THEORY; INFORMATION TRANSMISSION; JAMMING; KNOWLEDGE ENGINEERING; MANIFOLDS; MAXIMUM RANK; MINIMUM-DISTANCE DECODING; NETWORK CODING; NETWORK ERROR CORRECTION; NETWORK TOPOLOGY; NOISE; NON-COHERENT; OBJECT RECOGNITION; PROJECTIVE GEOMETRY; PROTOCOLS; RANDOM NETWORKS; RECEIVERS; REED-SOLOMON; SINGLETON BOUNDS; SPHERE PACKINGS; STOCHASTIC PROCESSES; STRONTIUM; SUBSPACE METRIC; TERMINOLOGY; TRANSMITTERS; UPPER BOUND; VECTOR SPACES;

VECTORS;

EID: 48849089497     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.926449     Document Type: Article

References (29)

1. T. Ho, R. Koetter,M. Médard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 442.
2. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 2003 Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2003.
3. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
4. L. Zheng and D. N. C. Tse, "Communication on the Grassmannian manifold: A geometric approach to the noncoherent multiple-antenna channel," IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 359-383, Feb. 2002.
5. N. Cai and R. W. Yeung, "Network coding and error correction," in Proc. 2002 IEEE Information Theory Workshop, Bangalore, India, Oct. 2002, pp. 119-122.
6. R. W. Yeung and N. Cai, "Network error correction, Part I: Basic concepts and upper bounds," Comm. Inf. and Systems, vol. 6, no. 1, pp. 19-36, 2006.
7. N. Cai and R. W. Yeung, "Network error correction, Part II: Lower bounds," Commun. Inf. and Systems, vol. 6, no. 1, pp. 37-54, 2006.
8. Z. Zhang, "Linear network error correction codes in packet networks," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 209-219, Jan. 2008.
9. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2596-2603, Jun. 2008.
10. S. Jaggi and M. Langberg, "Resilient network codes in the presence of eavesdropping Byzantine adversaries," in Proc. 2007 IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 541-545.
11. P. V. Ceccherini, "A q-analogous of the characterization of hypercubes as graphs," J. Geom., vol. 22, pp. 57-74, 1984.
12. L. Chihara, "On the zeros of the Askey-Wilson polynomials, with applications to coding theory," SIAM J. Math. Anal., vol. 18, no. 1, pp. 191-207, 1987.
13. W. J. Martin and X. J. Zhu, "Anticodes for the Grassmann and bilinear forms graphs," Des., Codes Cryptogr., vol. 6, pp. 73-79, 1995.
14. R. Ahlswede, H. K. Aydinian, and L. H. Khachatrian, "On perfect codes and related concepts," Des., Codes Cryptogr., vol. 22, pp. 221-237, 2001.
15. M. Schwartz and T. Etzion, "Codes and anticodes in the Grassmann graph," in J. Comb. Theory Ser. A, 2002, vol. 97, pp. 27-42.
16. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes," Des., Codes Cryptogr., Available online at arxiv.org/abs/1709. 1074, submitted for publication.
17. H. Wang, C. Xing, and R. Safavi-Naini, "Linear authentication codes: Bounds and constructions," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 866-872, Apr. 2003.
18. E. M. Gabidulin, "Theory of codes with maximal rank distance," Probl. Inf. Transm., vol. 21, pp. 1-12, Jul. 1985.
19. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes," in Proc. Int. Workshop on Coding and Cryptography, WCC 2005 (Lecture Notes in Computer Science), Ø. Ytrehus, Ed. Berlin, Germany: Springer-Verlag, 2006, vol. 3969.
20. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error-control in random network coding," IEEE Trans, Inf. Theory. [Online]. Available: http://arxiv.org/abs/0711.0708, submitted for publication
21. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs New York: Springer-Verlag, 1989.
22. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
23. E. R. Berlekamp, "The technology of error-correcting codes," Proc. IEEE, vol. 68, pp. 564-593, May 1980.
24. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
25. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
26. R. Lidl and H. Niederreiter, "Finite Fields," in The Encyclopedia of Mathematics, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1983, vol. 20.
27. R. M. Roth, Introduction to Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2006.
28. R. J. McEliece, "The Guruswami-Sudan decoding algorithm for Reed-Solomon codes," Jet Propulsion Lab., Pasadena, CA, Interplanetary Network Progr. Rep. 42-153, 2003. [Online]. Available: Www.systems. caltech.edu/EE/Faculty/rjm/papers/RSD-JPL.pdf
29. R. J. McEliece, B. Wang, and K. Watanabe, "Koetter interpolation over modules," in Proc. 2005 Allerton Conf. Communications Control and Computing, Monticello, IL, Oct. 2005.