Packing and covering properties of rank metric codes

IEEE Transactions on Information Theory

Volumn 54, Issue 9, 2008, Pages 3873-3883

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

Covering radius; Error control codes; Rank metric codes

Indexed keywords

COVERING RADIUS; ERROR CONTROL CODES; RANK METRIC CODES;

CODES (SYMBOLS);

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

References (36)

1. L. Hua, "A theorem on matrices over a field and its applications," Chinese Math. Soc., vol. 1, no. 2, pp. 109-163, 1951.
2. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," J. Combinat. Theory A, vol. 25, pp. 226-241, 1978.
3. P. Lusina, E. M. Gabidulin, and M. Bossert, "Maximum rank distance codes as space-time codes," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2757-2760, Oct. 2003.
4. E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, "Ideals over a noncommutative ring and their application in cryptology," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1991, vol. 573, pp. 482-489.
5. E. M. Gabidulin, "Optimal codes correcting lattice-pattern errors," Probl. Inf. Transm., vol. 21, no. 2, pp. 3-11, 1985.
6. R. M. Roth, "Maximum-rank array codes and their application to criss-cross error correction," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 328-336, Mar. 1991.
7. 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
8. M. Gadouleau and Z. Yan, "Constant-rank codes," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 876-880.
9. M. Gadouleau and Z. Yan, "Constant-rank codes and their connection to constant-dimension codes," in Proc. 1st IEEE Int. Workshop Wireless Network Coding, Jun. 2008, pp. 32-37.
10. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inf. Transm., vol. 21, no. 1, pp. 1-12, Jan. 1985.
11. N. Suresh-Babu, "Studies on rank distance codes," Ph.D. dissertation, IIT Madras, Madras, India, Feb. 1995.
12. K. Chen, "On the nonexistence of perfect codes with rank distance," Mathematische Nachrichten, vol. 182, pp. 89-98, 1996.
13. W. B. Vasantha and N. Suresh-Babu, "On the covering radius of rank-distance codes," Ganita Sandesh, vol. 13, pp. 43-48, 1999.
14. W. B. Vasantha and R. J. Selvaraj, "Multi-covering radii of codes with rank metric," in Proc. IEEE Inf. Theory Workshop, Oct. 2002, pp. 215-.
15. G. Richter and S. Plass, "Fast decoding of rank-codes with rank errors and column erasures," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2004, pp. 398-.
16. A. Kshevetskiy and E. M. Gabidulin, "The new construction of rank codes," in Proc. IEEE Int. Symp. Inf. Theory, Sep. 2005, pp. 2105-2108.
17. E. M. Gabidulin and P. Loidreau, "On subcodes of codes in the rank metric," in Proc. IEEE Int. Symp. Inf. Theory, Sep. 2005, pp. 121-123.
18. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes," in Proc. Int. Workshop Coding and Cryptography, 2005, pp. 36-45.
19. M. Gadouleau and Z. Yan, "Properties of codes with the rank metric," Proc. IEEE Globecom, pp. 1-5, Nov. 2006.
20. M. Gadouleau and Z. Yan, "Decoder error probability of MRD codes," in Proc. IEEE Int. Theory Workshop, Oct. 2006, pp. 264-268 [Online]. Available:http://arxiv.org/abs/cs/0610148
21. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/pdf/cs.IT/0612051, to be published
22. P. Loidreau, "Properties of codes in rank metric," [Online]. Available: http://arxiv.org/pdf/cs.DNI/0610057
23. P. Delsarte, "Four fundamental parameters of a code and their combinatorial significance," Inf. Control, vol. 23, pp. 407-438, 1973.
24. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, ser. Information and System Sciences, T. Kailath, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971.
25. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
26. G. D. Cohen, I. Honkala, S. Litsyn, and A. C. Lobstein, Covering Codes. New York: Elsevier, 1997.
27. P. Loidreau, "Ŕtude et Optimisation de Cryptosystèmes à Clé Publique Fondés sur 1a Théorie des Codes Correcteurs," Ph.D. dissertation, École Polytechnique, Paris, France, May 2001.
28. G. E. Andrews, "The theory of partitions," in Encyclopedia of Mathematics and its Applications, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2.
29. D. J. Kleitman, "On a combinatorial conjecture of Erdös," J. Combinat. Theory, vol. 1, pp. 209-214, 1966.
30. P. Delsarte and V. I. Levenshtein, "Association schemes and coding theory," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2477-2504, Oct. 1998.
31. G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, "Further results on the covering radius of codes," IEEE Trans. Inf. Theory, vol. IT-32, no. 5, pp. 680-694, Sep. 1986.
32. G. van Wee, "Improved sphere bounds on the covering radius of codes," IEEE Trans. Inf. Theory, vol. IT-34, no. 2, pp. 237-245, Mar. 1988.
33. G. van Wee, "Bounds on packings and coverings by spheres in q-ary and mixed Hamming spaces," J. Combinat. Theory A, vol. 57, pp. 116-129, 1991.
34. C.-P. Chen and F. Qi, "The best bounds of harmonic sequence," Jun. 20A3 [Online]. Available: http://arxiv:math.ca/0306233v1
35. The MathWorks, Inc., "MATLAB communications toolbox function reference: gf," Natick, MA [Online]. Available: http://www.mathworks.com/access/helpdesk/help/toolbox/comm/ug/gf.html
36. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant weight codes," IEEE Trans. Inf. Theory, vol. 36, no. 6, pp. 1334-1380, Nov. 1990.