New decoder for double-error-correcting binary BCH codes

E. H. Lu*, T. Chang

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

15 Scopus citations

Abstract

A step-by-step decoding algorithm is presented for double-error-correcting binary BCH codes of length n = 2m - 1. The decoding algorithm can directly determine whether any received bit is correct or not without knowing the number of errors which have occurred in the received vector and also without determining the corresponding error location polynomial. The merits of the hardware decoder based on the algorithm are that it is very simple and fast. In addition, it is suitable for decoding long block codes.

Original languageEnglish
Pages (from-to)129-132
Number of pages4
JournalIEE Proceedings: Communications
Volume143
Issue number3
DOIs
StatePublished - 1996

Keywords

  • BCH code
  • Hardware decoder
  • Step-by-step decoding algorithm

Fingerprint

Dive into the research topics of 'New decoder for double-error-correcting binary BCH codes'. Together they form a unique fingerprint.

Cite this