New step-by-step decoding for binary BCH codes

Ching Lung Chr, Szu-Lin Su, Shao Wei Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

A new efficient step-by-step decoding algorithm for terror-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is presented. Based on logical analysis, we obtain a simple rule, which can directly determine whether any bit in received word is correct or not without finding the error-location polynomial. The new method omits one largest-scale matrix calculation and the operations of multiplication are reduced significantly, compared with the conventional step-by-step decoding algorithm.

Original languageEnglish
Title of host publication2004 9th IEEE Singapore International Conference on Communication Systems, ICCS
Pages456-460
Number of pages5
Publication statusPublished - 2004 Dec 1
Event2004 9th IEEE Singapore International Conference on Communication Systems, ICCS - , Singapore
Duration: 2004 Sep 62004 Sep 9

Publication series

Name2004 9th IEEE Singapore International Conference on Communication Systems, ICCS

Other

Other2004 9th IEEE Singapore International Conference on Communication Systems, ICCS
CountrySingapore
Period04-09-0604-09-09

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'New step-by-step decoding for binary BCH codes'. Together they form a unique fingerprint.

  • Cite this

    Chr, C. L., Su, S-L., & Wu, S. W. (2004). New step-by-step decoding for binary BCH codes. In 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS (pp. 456-460). (2004 9th IEEE Singapore International Conference on Communication Systems, ICCS).