DocumentCode
2976587
Title
Fast encoding and decoding of Gabidulin codes
Author
Silva, Danilo ; Kschischang, Frank R.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
2858
Lastpage
2862
Abstract
Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on low-complexity normal bases. In addition, a new decoding algorithm is proposed based on a transform-domain approach. Together, these represent the fastest known algorithms for encoding and decoding Gabidulin codes.
Keywords
Reed-Solomon codes; communication complexity; decoding; error correction codes; time-domain analysis; transform coding; Gabidulin code; Reed-Solomon code; decoding algorithm; fast encoding; low-complexity normal base; network coding; practical error control; rank-metric analog; time-domain method; transform-domain approach; Block codes; Decoding; Encoding; Equations; Error correction; Linear algebra; Network coding; Reed-Solomon codes; Time domain analysis; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205272
Filename
5205272
Link To Document