Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme

Ching-Lung CHR; Szu-Lin SU; Shao-Wei WU

doi:10.1093/ietfec/e89-a.8.2235

Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme

Ching-Lung CHR, Szu-Lin SU, Shao-Wei WU

Full Text Views

0

Share
Cite this

Summary :

Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.8 pp.2235-2238

Publication Date: 2006/08/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.8.2235

Type of Manuscript: LETTER

Category: Coding Theory

Cite this

Copy

Ching-Lung CHR, Szu-Lin SU, Shao-Wei WU, "Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 8, pp. 2235-2238, August 2006, doi: 10.1093/ietfec/e89-a.8.2235.
Abstract: Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.8.2235/_p

Copy

@ARTICLE{e89-a_8_2235,
author={Ching-Lung CHR, Szu-Lin SU, Shao-Wei WU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme},
year={2006},
volume={E89-A},
number={8},
pages={2235-2238},
abstract={Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.},
keywords={},
doi={10.1093/ietfec/e89-a.8.2235},
ISSN={1745-1337},
month={August},}

Copy

TY - JOUR
TI - Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2235
EP - 2238
AU - Ching-Lung CHR
AU - Szu-Lin SU
AU - Shao-Wei WU
PY - 2006
DO - 10.1093/ietfec/e89-a.8.2235
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2006
AB - Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.
ER -