### 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 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Engineering(all)

### Cite this

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

}

*Proceedings of the IASTED International Conference on Communication Systems and Networks.*, 450-095, pp. 254-258, Proceedings of the IASTED International Conference on Communication Systems and Networks, Marbella, Spain, 04-09-01.

**Decoding algorithm for binary BCH codes.** / Chr, Ching Lung; Su, Szu-Lin; Wu, Shao Wei.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Decoding algorithm for binary BCH codes

AU - Chr, Ching Lung

AU - Su, Szu-Lin

AU - Wu, Shao Wei

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=11144328185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11144328185&partnerID=8YFLogxK

M3 - Conference contribution

SN - 088986456X

SN - 9780889864566

SP - 254

EP - 258

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

A2 - Salvador, C.E.P.

ER -