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
Event2004 9th IEEE Singapore International Conference on Communication Systems, ICCS - , Singapore
Duration: 2004 Sep 62004 Sep 9

Other

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

Fingerprint

Decoding
Polynomials

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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)
Chr, Ching Lung ; Su, Szu-Lin ; Wu, Shao Wei. / New step-by-step decoding for binary BCH codes. 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS. 2004. pp. 456-460
@inproceedings{34fcdb261d6245a5bea21adb76e89fe1,
title = "New step-by-step decoding for binary BCH codes",
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.",
author = "Chr, {Ching Lung} and Szu-Lin Su and Wu, {Shao Wei}",
year = "2004",
language = "English",
isbn = "0780385497",
pages = "456--460",
booktitle = "2004 9th IEEE Singapore International Conference on Communication Systems, ICCS",

}

Chr, CL, Su, S-L & Wu, SW 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, Singapore, 04-09-06.

New step-by-step decoding for binary BCH codes. / Chr, Ching Lung; Su, Szu-Lin; Wu, Shao Wei.

2004 9th IEEE Singapore International Conference on Communication Systems, ICCS. 2004. p. 456-460.

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

TY - GEN

T1 - New step-by-step decoding for binary BCH codes

AU - Chr, Ching Lung

AU - Su, Szu-Lin

AU - Wu, Shao Wei

PY - 2004

Y1 - 2004

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

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

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

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

M3 - Conference contribution

SN - 0780385497

SP - 456

EP - 460

BT - 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS

ER -

Chr CL, Su S-L, Wu SW. New step-by-step decoding for binary BCH codes. In 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS. 2004. p. 456-460