Properties of codes with the rank metric

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2006, Pages

  Gadouleau, Maximilien ^a   Zhiyuan, Yan ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

MAXIMUM RANK DISTANCE (MRD) CODES; MRD CODES; SINGLETON BOUNDS; SPHERE-PACKING BOUNDS;

CODES (SYMBOLS);

EID: 50949112855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.173     Document Type: Conference Paper

References (21)

1. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communication: Performance criterion and code construction," IEEE Trans. Info. Theory, vol. 44, pp. 774-765, March 1998.
2. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Info. Theory, vol. 37, no. 2, pp. 328-336, March 1991.
3. P. Lusina, E. Gabidulin, and M. Bossert, "Maximum Rank Distance codes as space-time codes," IEEE Trans. Info. Theory, vol. 49, pp. 2757-2760, Oct. 2003.
4. E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, "Ideals over a non-commutative ring and their application in cryptology," LNCS, vol. 573, pp. 482-489, 1991.
5. E. M. Gabidulin, "Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness," Codes and Cyphers, pp. 17-31, 1995.
6. A. V. Ourivski and E. M. Gabidulin, "Column scrambler for the GPT cryptosystem," Discrete Applied Mathematics, vol. 128, pp. 207-221, 2003.
7. R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory," Jet Propulsion Lab. DSN Progress Report, pp. 114-116, 1978.
8. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems on Information Transmission, vol. 21, no. 1, pp. 1-12, Jan. 1985.
9. N. Suresh Babu, "Studies on rank distance codes," Ph.D Dissertation, IIT Madras, Feb. 1995.
10. U. Sripati and B. Sundar Rajan, "On the rank distance of cyclic codes," Proc. IEEE Int. Symp. on Information Theory, p. 72, July 2003.
11. W. B. Vasantha and N. Suresh Babu, "On the covering radius of rank-distance codes," Ganita Sandesh, vol. 13, pp. 43-48, 1999.
12. W. B. Vasantha and R. J. Selvaraj, "Multi-covering radii of codes with rank metric," Proc. Information Theory Workshop, p. 215, Oct. 2002.
13. W. B. Vasantha and R. S. Raja Durai, "Maximum rank distance codes with complementary duals: an application to F-adder channel," Dec. 2002.
14. K. N. Manoj and B. Sundar Rajan, "Full Rank Distance codes," Technical Report, IISc Bangalore, Oct. 2002.
15. A. Kshevetskiy and E. M. Gabidulin, "The new construction of rank codes," Proc. IEEE Int. Symp. on Information Theory, pp. 2105-2108, Sept. 2005.
16. E. M. Gabidulin and P. Loidreau, "On subcodes of codes in the rank metric," Proc. IEEE Int. Symp. on Information Theory, pp. 121-123, Sept. 2005.
17. P. Loidreau, "Étude et optimisation de cryptosystèmes à clé publique fondés sur la théorie des codes correcteurs," Ph.D. Dissertation, École Polytechnique, Paris, France, May 2001.
18. H. F. Lu and P. V. Kumar, "Rate-diversity Tradeoff of Space-time Codes with Fixed Alphabet and Optimal Constructions for PSK Modulation," IEEE Trans. Info. Theory, vol. 49, no. 10, pp. 2747-2751, Oct. 2003.
19. R. Blahut, Theory and Practice of Error Control Codes. Addison-Wesley, 1983.
20. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
21. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, and J. R. Schatz, "Covering radius-Survey and recent results," IEEE Trans. Info. Theory, vol. 31, pp. 328-343, May 1985.