A matroid framework for noncoherent random network communications

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1031-1045

  Gadouleau, Maximilien ^a,b   Goupil, Alban ^a  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Affine geometry; constant dimension codes; constant weight codes; error control codes; matroids; network coding; network protocols; rank metric codes; routing

Indexed keywords

AFFINE GEOMETRIES; CONSTANT-DIMENSION CODES; CONSTANT-WEIGHT CODES; ERROR CONTROL CODES; MATROIDS; NETWORK CODING; RANK METRIC CODES; ROUTING;

BINARY CODES; DECODING; GRAPH THEORY; INFORMATION THEORY; MATHEMATICAL OPERATORS; SIGNAL ENCODING;

NETWORK PROTOCOLS;

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

References (28)

1. R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
2. M. Gadouleau and A. Goupil, "Binary codes for packet error and packet loss correction in store and forward," presented at the Int. ITG Conf. Source and Channel Coding, Siegen, Germany, Jan. 2010.
3. J. G. Oxley, Matroid Theory. Oxford, U.K.: Oxford Univ. Press, 2006.
4. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5479-5490, Dec. 2009.
5. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems of Inf. Transmiss., vol. 21, no. 1, pp. 1-12, Jan. 1985.
6. S. Riis, "Linear versus non-linear boolean functions in network flow," presented at the CISS, Princeton, NJ, Mar. 2004 [Online]. Available: http://www.eecs.qmul.ac.uk/smriis/Summery.pdf
7. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 3202-3206, Jul. 2008.
8. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Commun. Inf. Syst., vol. 6, no. 1, pp. 19-36, 2006.
9. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Commun. Inf. Syst., vol. 6, no. 1, pp. 37-54, 2006.
10. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes," Designs, Codes Cryptogr., vol. 50, no. 2, pp. 163-172, Feb. 2009.
11. T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 2909-2919, Jul. 2009.
12. M. Bossert and E. M. Gabidulin, "One family of algebraic codes for network coding," in Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, Jun./Jul. 2009, pp. 2863-2866.
13. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
14. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," J. Combinator. Theory A, vol. 25, no. 3, pp. 226-241, Nov. 1978.
15. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 328-336, Mar. 1991.
16. M. Deza, Perfect Matroid Designs, N. White, Ed. Cambridge, U.K.: Cambridge Univ. Press, 1992.
17. P. J. Cameron, Polynomial Aspects of Codes, Matroids and Permutation Groups. [Online]. Available: http://www.maths.qmul.ac.uk/~pjc/ csgnotes/cmpgpoly.pdf
18. D. Silva, F. R. Kschischang, and R. Kötter, "Communication over finite- field matrix channels," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1296-1305, Mar. 2010.
19. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE Infocom, Miami, FL, Mar. 2005, pp. 2235-2245.
20. Y. Li, E. Soljanin, and P. Spasojević, "Collecting coded coupons over generations," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 2010, pp. 2448-2452.
21. Y. Li, E. Soljanin, and P. Spasojević, "Collecting coded coupons over overlapping generations," in Proc. IEEE Int. Symp. Network Coding, Toronto, ON, Jun. 2010, pp. 1-6.
22. P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collectors, caching algorithms and self-organizing search," Discr. Appl. Math., vol. 39, no. 3, pp. 207-229, Nov. 1992.
23. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science. Reading, MA: Addison-Wesley, 1994.
24. H. Robbins, "A remark on Stirling's formula," The Amer. Math. Monthly, vol. 62, no. 1, pp. 26-29, Jan. 1955.
25. D. E. Knuth, The Art of Computer Programming Vol. 3. Reading, MA: Addison-Wesley, 1973, vol. 3.
26. B. Birregah, P. K. Doh, and K. H. Adjallah, "A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations," Eur. J. Combinator., vol. 31, no. 5, pp. 1205-1216, Jul. 2010.
27. M. Gadouleau and Z. Yan, "Packing and covering properties of subspace codes for error control in random linear network coding," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2097-2108, May 2010.
28. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Inf. Theory, vol. 8, no. 3, pp. 203-207, Apr. 1962.