Complexity of decoding Gabidulin codes

被引：17

作者：

Gadouleau, Maximilien ^{[1
]}

Yan, Zhiyuan ^{[1
]}

机构：

[1] Lehigh Univ, Dept Elect & Comp Engn, Bethlehem, PA 18015 USA

来源：

2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3 | 2008年

关键词：

D O I：

10.1109/CISS.2008.4558679

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we analyze the complexity of decoding Gabidulin codes using the analogs in rank metric codes of the extended Euclidean algorithm or the Berlekamp-Massey algorithm. We show that a subclass of Gabidulin codes reduces the complexity and the memory requirements of the decoding algorithm. We also simplify an existing algorithm for finding roots of linearized polynomials for decoding Gabidulin codes. Finally we analyze and compare the asymptotic complexities of different decoding algorithms for Gabidulin codes.

引用

页码：1081 / 1085

页数：5

共 24 条

[1]

BERLEKAMP E, 1967, P IEEE INT S INF THE

[2]

BERLEKAMP E, 1984, ALBEBRAIC CODING THE

[3] CYCLIC DECODING PROCEDURES FOR BOSE-CHAUDHURI-HOCQUENGHEM CODES [J].

CHIEN, RT .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (04) :357-&

[4] BILINEAR FORMS OVER A FINITE-FIELD, WITH APPLICATIONS TO CODING THEORY [J].

DELSARTE, P .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 25 (03) :226-241

[5]

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

[6]

Gabidulin E. M., 1985, PROBL PEREDACHI INF, V21, P3

[7]

GABIDULIN EM, 1991, LECT NOTES COMPUT SC, V547, P482

[8]

GABIDULIN EM, PROPERTIES SUBSPACE

[9]

GADOULEAU M, IEEE T INFORM UNPUB

[10]

KOETTER R, IEEE T INFO TH UNPUB

← 1 2 3 →