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

2009 IEEE Information Theory Workshop, ITW 2009

Volumn , Issue , 2009, Pages 485-489

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE ERRORS; ANALYTICAL EXPRESSIONS; BOUNDED DISTANCE DECODER; COLUMN SPACE; DECODER ERROR PROBABILITY; ERROR CORRECTION CAPABILITY; ERROR PERFORMANCE; LINEAR NETWORK CODING; MAXIMUM RANK DISTANCE CODES; NETWORK CODING; RANK DISTANCE; RANK METRIC CODES; SYMMETRIC CHANNELS; UPPER BOUND;

DECODING; DIELECTRIC DEVICES; INFORMATION THEORY; PROBABILITY; SIGNAL ENCODING;

ERROR CORRECTION;

EID: 76249125906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2009.5351428     Document Type: Conference Paper

References (23)

1. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems on Information Transmission, vol.21, no.1, pp. 1-12, Jan. 1985.
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. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," Journal of Combinatorial Theory A, vol.25, pp. 226-241, 1978.
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. P. Lusina, E. M. Gabidulin, and M. Bossert, "Maximum rank distance codes as space-time codes," IEEE Trans. Info. Theory, vol.49, pp. 2757-2760, Oct. 2003.
6. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Info. Theory, vol.54, no.9, pp. 3951-3967, 2008.
7. G. Richter and S. Plass, "Fast decoding of rank-codes with rank errors and column erasures," Proc. IEEE Int. Symp. on Information Theory, p. 398, June 2004.
8. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes," Proc. International Workshop on Coding and Cryptography, 2005.
9. M. Gadouleau and Z. Yan, "Complexity of decoding Gabidulin codes," Proc. IEEE CISS, pp. 1081-1085, March 2008.
10. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Commun. Inform. Syst., vol.6, no.1, pp. 19-36, 2006.
11. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Commun. Inform. Syst., vol.6, no.1, pp. 37-54, 2006.
12. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Info. Theory, vol.54, no.8, pp. 3579-3591, August 2008.
13. R. M. Roth, "Probabilistic crisscross error correction," IEEE Trans. Info. Theory, vol.43, no.5, pp. 1425-1438, Sept. 1997.
14. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," IEEE Trans. Info. Theory, vol.54, no.7, pp. 3202-3206, July 2008.
15. R. J. McEliece and L. Swanson, "On the decoder error probability for Reed-Solomon codes," IEEE Trans. Info. Theory, vol.32, no.5, pp. 701-703, Sept. 1986.
16. K.-M. Cheung, "More on the decoder error probability for Reed-Solomon codes," IEEE Trans. Info. Theory, vol.35, no.4, pp. 895-900, July 1989.
17. L. Tolhuizen, "A universal upper bound on the miscorrection probability with bounded distance decoding for a code used on an error-value symmetric channel," Proc. Eurocode, Int. Symp. on Coding Theory and Applications, pp. 313-320, 1992.
18. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, ser. A Series of Modern Surveys in Mathematics. Springer-Verlag, 1989, vol.18, no.3.
19. 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.
20. M. Gadouleau and Z. Yan, "Bounds on covering codes with the rank metric," to appear in IEEE Communications Letters, August 2009, available at http://arxiv.org/abs/0809.2968.
21. --, "Constant-rank codes and their connection to constant-dimension codes," submitted to IEEE Trans. Info. Theory, July 2008, available at http://arxiv.org/abs/0803.2262.
22. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," 2008, available at http://arxiv.org/abs/0805.3824v1.
23. E. M. Gabidulin, "Optimal codes correcting lattice-pattern errors," Problems on Information Transmission, vol.21, no.2, pp. 3-11, 1985.