On subcodes of codes in rank metric

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 121-123

  Gabidulin, Ernst M ^a   Loidreau, Pierre ^b  

^a MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^b ENSTA PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-CORRECTING CAPABILITY; MAXIMUM RANK DISTANCE CODES; POLYNOMIAL-TIME ENCODING-DECODING;

ALGORITHMS; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; INFORMATION THEORY; POLYNOMIALS;

CODES (SYMBOLS);

EID: 33749427186     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523305     Document Type: Conference Paper

References (8)

1. P. Delsarte. On subfield subcodes of modified Reed-Solomon codes. IEEE Transactions on Information Theory, 20:575-576, 1975.
2. E. M. Gabidulin. Theory of codes with maximal rank distance. Problems of Information Transmission, 21:1-12, July 1985.
3. E. M. Gabidulin. A fast matrix decoding algorithm for rank-error correcting codes. In G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, editors, Algebraic coding, volume 573 of LNCS, pages 126-133. Springer-Verlag, 1991.
4. M. Hattori, R. J. McEliece, and G. Solomon. Subspace subcodes of Reed-Solomon codes. IEEE Transactions on Information Theory, 44(5), September 1998.
5. J. M. Jensen. Subgroup subcodes. IEEE Transactions on Information Theory, 41(3):781-785, May 1995.
6. G. Richter and S. Plass. Fast decoding of rank-codes with rank errors and column erasures. In Proceedings of ISIT 2004, 2004.
7. R. M. Roth. Maximum-Rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory, 37(2):328-336, March 1991.
8. M. van Dijk and L. Tolhuizen. Efficient encoding for a class of subspace subcodes. IEEE Transactions on Information Theory, 45(6):2142-2146, 1999.