An Improved Decoding Algorithm for Generalized RDP Codes

The generalized RDP codes are identified as the most practical and efficient triple-erasure correcting MDS (maximum-distance separable) codes, since they can encode optimally and support arbitrary code length. However, none of the existing decoding algorithms for these codes is adequate in that thei...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 20; no. 4; pp. 632 - 635
Main Authors Huang, Zhijie, Jiang, Hong, Zhou, Ke
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Array codes
Arrays
Complexity
Computational complexity
Computer science
Decoding
Encoding
generalized RDP codes
Indexes
Lower bounds
maximum-distance separable (MDS) codes
Optimization
storage systems
storage systems
Array codes
generalized RDP codes
maximum-distance separable (MDS) codes
Online AccessGet full text
ISSN1089-7798
1558-2558
DOI10.1109/LCOMM.2016.2522414

Cover

More Information
Summary:The generalized RDP codes are identified as the most practical and efficient triple-erasure correcting MDS (maximum-distance separable) codes, since they can encode optimally and support arbitrary code length. However, none of the existing decoding algorithms for these codes is adequate in that their decoding complexity leaves a relatively large room for improvement. In this letter, we present an improved decoding algorithm for the generalized RDP codes. Compared with the existing decoding algorithms, the proposed algorithm has a much lower decoding complexity, which is very close to the theoretical lower bound.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2016.2522414