Fast Encoding and Decoding of Gabidulin Codes

被引：46

作者：

Silva, Danilo ^{[1
]}

Kschischang, Frank R. ^{[1
]}

机构：

[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年

关键词：

D O I：

10.1109/ISIT.2009.5205272

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：2858 / 2862

页数：5

共 11 条

[1]

[Anonymous], 2003, Modern Computer Algebra

[2]

Friedberg SH., 2003, LINEAR ALGEBRA

[3]

Gabidulin E. M., 1985, Problems of Information Transmission, V21, P1

[4] Complexity of decoding Gabidulin codes [J].

Gadouleau, Maximilien ;

Yan, Zhiyuan .

2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, :1081-1085

[5]

GAO S, 1993, THESIS U WATERLOO DE

[6]

Gao SH, 2000, J SYMB COMPUT, V29, P879, DOI [10.1006/jsco.1999.0309, 10.1006/jsco.2000.0309]

[7] Coding for errors and erasures in random network coding [J].

Koetter, Ralf ;

Kschischang, Frank R. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3579-3591

[8]

Loidreau P, 2006, LECT NOTES COMPUT SC, V3969, P36

[9]

Niederreiter H., 1983, FINITE FIELDS

[10]

Richter G., 2004, P ITG C SOURC CHANN, P249

← 1 2 →