On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes

IEEE Transactions on Information Theory

Volumn 54, Issue 7, 2008, Pages 3202-3206

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

Bounded distance decoder; Decoder error probability; Rank metric codes

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); DECODING; EIGENVALUES AND EIGENFUNCTIONS; ERROR CORRECTION;

(PL) PROPERTIES; ERROR CORRECTION CAPABILITY; ERROR PROBABILITIES; LINEAR SUBSPACES; MAXIMUM DISTANCE SEPARABLE (MDS) CODES; MAXIMUM RANK DISTANCE (MRD) CODES; MRD CODES; RANK DISTANCE;

PROBABILITY;

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

References (18)

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. Combin. Theory A, vol. 25, ppp. 226-241, 1978.
3. E. M. Gabidulin, "theory ot codes with maximum rank distance," Probl. Inf. Transm., vol. 21, no. 1, pp. 1-12, Jan. 1985.
4. 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.
5. 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.
6. P. Lusina, E. M. Gabidulin, and M. Bossert, "Maximum rank distance codes as space-time codes," IEEE Trans. Inf. Theory, vol. 49, pp. 2757-2760, Oct. 2003.
7. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, submitted for publication.
8. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, submitted for publication.
9. 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, p. 398.
10. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes." in Proc. 4th Int. Workshov Coding Crypto., 2005.
11. R. J. McEliece and L. Swanson, "On the decoder error probability for Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 32, no. 5, pp. 701-703, Sep. 1986.
12. P. Loidreau and R. Overbeck, "Decoding rank errors beyond the error-correction capability," Proc. ACCT-10, 2006.
13. L. Driessen and L. Vries, "Performance calculation of the compact disc error correcting code," in Proc. Int. Conf. Video Data Recording, Apr. 1982, pp. 385-395.
14. K.-M. Cheung, "More on the decoder error probability for Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 35, no. 4, pp. 895-900, Jul. 1989.
15. L. Tolhuizen, "A universal upper bound on the miscorrection probability with bounded distance decoding for a code used on an error-value symmetric channel," in Proc. Eurocode. Int. Symp. Coding Theory and Appl., 1992, pp. 313-320.
16. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.
17. G. E. Andrews, The Theory of Partitions, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2, Encyclopedia of Mathematics and its Applications.
18. S. Roman, Advanced Linear Algebra, 2nd ed. New York: Springer, 2005, vol. 135, Graduate Texts in Mathematics.