Packing and covering properties of subspace codes for error control in random linear network coding

IEEE Transactions on Information Theory

Volumn 56, Issue 5, 2010, Pages 2097-2108

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^b  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b Lehigh University   (United States)

Author keywords

Constant dimension codes (CDCs); Covering; Error control codes; Injection metric; Network coding; Packing; Random linear network coding; Subspace codes; Subspace metric

Indexed keywords

COVERING; ERROR CONTROL CODE; LINEAR NETWORK CODING; NETWORK CODING; SUBSPACE CODES; SUBSPACE METRIC;

ASYMPTOTIC ANALYSIS; ERRORS; LINEAR NETWORKS; OPTIMIZATION; TOPOLOGY;

INFORMATION THEORY;

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

References (22)

1. T. Ho, M. Médard, R. Koetter, D. R. 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.
2. T. Ho and D. S. Lun, Network Coding: An Introduction. New York: Cambridge Univ. Press, 2008.
3. R. Koetter 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.
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. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding, " IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
6. V. Skachek, "Recursive code construction for random networks, " IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1378-1382, Mar. 2010.
7. M. Gadouleau and Z. Yan, "Construction and covering properties of constant-dimension codes, " IEEE Trans. Inf. Theory, 2009 [Online]. Available: http://arxiv.org/abs/0903.2675, submitted for publication
8. A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance, " in Mathematical Methods in Computer Science, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, Dec. 2008, vol. 5393, pp. 31-42.
9. 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.
10. T. Etzion and A. Vardy, "Error-correcting codes in projective space, " in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 871-875.
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. E. M. Gabidulin and M. Bossert, "Codes for network coding, " in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 867-870.
13. V. Pless and W. Huffman, Eds., Handbook of Coding Theory. New York: Elsevier, 1998.
14. G. D. Cohen, I. Honkala, S. Litsyn, and A. C. Lobstein, Covering Codes. New York: Elsevier, 1997.
15. I. Honkala and A. Klapper, "Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers, " Designs Codes Cryptogr., vol. 23, no. 2, pp. 131-145, Jul. 2001.
16. G. E. Andrews, The Theory of Partitions, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2, Encyclopedia of Mathematics and its Applications.
17. 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.
18. G. Gasper and M. Rahman, Basic Hypergeometric Series, 2nd ed. Cambridge, U. K.: Cambridge Univ. Press, 2004, vol. 96, Encyclopedia of Mathematics and its Applications.
19. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables. New York: Dover, 1965.
20. M. Gadouleau and Z. Yan, "Packing and covering properties of rank metric codes, " IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3873-3883, Sep. 2008.
21. W. E. Clark and L. A. Dunning, "Tight upper bounds for the domination numbers of graphs with given order and minimum degree, " Electron. J. Combinatorics, vol. 4, 1997.
22. M. Gadouleau and Z. Yan, "Bounds on covering codes with the rank metric, " IEEE Commun. Lett., vol. 13, no. 9, pp. 691-693, Sep. 2009.