### Abstract

A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the "matrix-computing" element.

Original language | English |
---|---|

Title of host publication | Proceedings of the IASTED International Conference on Communication Systems and Networks |

Editors | C.E.P. Salvador |

Pages | 254-258 |

Number of pages | 5 |

Publication status | Published - 2004 |

Event | Proceedings of the IASTED International Conference on Communication Systems and Networks - Marbella, Spain Duration: 2004 Sep 1 → 2004 Sep 3 |

### Other

Other | Proceedings of the IASTED International Conference on Communication Systems and Networks |
---|---|

Country | Spain |

City | Marbella |

Period | 04-09-01 → 04-09-03 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'Decoding algorithm for binary BCH codes'. Together they form a unique fingerprint.

## Cite this

Chr, C. L., Su, S-L., & Wu, S. W. (2004). Decoding algorithm for binary BCH codes. In C. E. P. Salvador (Ed.),

*Proceedings of the IASTED International Conference on Communication Systems and Networks*(pp. 254-258). [450-095]