2005
DOI: 10.1093/ietfec/e88-a.8.2236
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Step-by-Step Decoding of Binary BCH Codes

Abstract: In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes based on logical analysis. Compared to the conventional stepby-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 5 publications
0
0
0
Order By: Relevance