Bounds on covering codes with the rank metric

IEEE Communications Letters

Volumn 13, Issue 9, 2009, Pages 691-693

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^b  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b Lehigh University   (United States)

Author keywords

Covering radius; Error control codes; Geometrical properties; Intersection number; Rank metric codes

Indexed keywords

COVERING RADIUS; ERROR CONTROL CODES; GEOMETRICAL PROPERTIES; INTERSECTION NUMBER; RANK METRIC CODES;

CONTROL THEORY; GEOMETRY; SET THEORY; SIGNAL ENCODING; TOPOLOGY;

METRIC SYSTEM;

EID: 70350409985     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2009.090447     Document Type: Article

References (9)

1. M. Gadouleau and Z. Yan, "Packing and covering properties of rank metric codes," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 3873-3883, Sept. 2008.
2. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inform. Theory vol. 54, no. 9, pp. 3951-3967, Sept. 2008.
3. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
4. M. Gadouleau and Z. Yan, "Construction and covering properties of constant-dimension codes," submitted to IEEE Trans. Inform. Theory 2009. Available at http://arxiv.org/abs/0903.2675.
5. M. Gadouleau and Z. Yan (2009), "Bounds on covering codes with the rank metric." [Online]. Available: http://arxiv.org/abs/0809.2968
6. G. E. Andrews, The Theory of Partitions, ser. Encyclopedia of Mathematics and its Applications, G.-C. Rota, ed. Reading, MA: Addison-Wesley, 1976, vol. 2.
7. P. Delsarte, "Properties and applications of the recurrence F(i + 1; k + 1; n+1) = qk+1F(i; k+1; n)..qkF(i; k; n)," SIAM J. Applied Mathematics, vol. 31, no. 2, pp. 262-270, Sept. 1976.
8. E. Bannai and T. Ito, Algebraic Cominatorics I. Association Schemes The Benjamin/Cummings Publishing Company, 1983.
9. W. E. Clark and L. A. Dunning, "Tight upper bounds for the domination numbers of graphs with given order and minimum degree," Electronic J. Combinatorics, vol. 4, 1997.