Step-by-step decoding algorithm for Reed-Solomon codes

T. C. Chen, C. H. Wei, S. W. Wei

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A new step-by-step decoding algorithm for decoding Reed-Solomon codes over GF(2'") is presented. Based on several properties of the syndrome matrices, the new step-by-step decoding algorithm can directly determine whether every received symbol is an error locator. The detection of error location is based only on the determinant of a v x v syndrome matrix, where v is the number of errors. When an error location is found, its corresponding error value can also be determined by performing a determinant division operation between two syndrome matrices. The new decoding algorithm can significantly reduce computation complexity and improve the decoding speed compared with the conventional step-by-step decoding algorithm.

Original languageEnglish
Pages (from-to)8-11
Number of pages4
JournalIEE Proceedings: Communications
Volume147
Issue number1
DOIs
Publication statusPublished - 2000 Jan 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Step-by-step decoding algorithm for Reed-Solomon codes'. Together they form a unique fingerprint.

  • Cite this