Fast encoding and decoding of gabidulin codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2858-2862

  Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

A-TRANSFORM; DECODING ALGORITHM; ENCODING AND DECODING; ERROR CONTROL; FAST ENCODING; LOW-COMPLEXITY; NETWORK CODING; NORMAL BASIS;

ENCODING (SYMBOLS); IMAGE CODING; INFORMATION THEORY; REED-SOLOMON CODES;

DECODING;

EID: 70449488937     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205272     Document Type: Conference Paper

References (11)

1. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm., vol. 21, no. 1, pp. 1-12, 1985.
2. R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
3. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, 2008.
4. G. Richter and S. Plass, "Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm," in Proc. ITG Conf. on Source and Channel Coding, Erlangen, Germany, Jan. 2004, pp. 249-256.
5. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes," in Proc. 4th Int. Workshop on Coding and Cryptography, Bergen, Norway, Mar. 2005, pp. 36-45.
6. M. Gadouleau and Z. Yan, "Complexity of decoding Gabidulin codes," in Proc. Annual Conf. Inform. Sciences and Syst., Princeton, NJ, Mar. 19-21, 2008, pp. 1081-1085.
7. S. H. Friedberg, A. J. Insel, and L. E. Spence, Linear Algebra, 4th ed. Upper Saddle River, NJ: Prentice Hall, 2003.
8. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison- Wesley, 1983.
9. S. Gao, "Normal bases over finite fields," Ph.D. dissertation, University of Waterloo, Department of Combinatorics and Optimization, 1993.
10. S. Gao, J. von zur Gathen, D. Panario, and V. Shoup, "Algorithms for exponentiation in finite fields," J. Symbolic Computation, vol. 29, pp. 879-889, 2000.
11. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, 2nd ed. New York: Cambridge University Press, 2003.