Efficient decoding of the (23, 12, 7) Golay code up to five errors

A novel and efficient algorithm for decoding the (23, 12, 7) Golay code with the five-error correcting capability is developed. Core to the key idea is innovatively utilizing the relationship of syndromes among error patterns, which is derived from the property of perfect code. Consequently, two met...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences Vol. 253; pp. 170 - 178
Main Authors: Lee, Hung-Peng, Chu, Shao-I, Chang, Hsin-Chiu
Format: Journal Article
Language:English
Published: Elsevier Inc 20.12.2013
Subjects:
ISSN:0020-0255, 1872-6291
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A novel and efficient algorithm for decoding the (23, 12, 7) Golay code with the five-error correcting capability is developed. Core to the key idea is innovatively utilizing the relationship of syndromes among error patterns, which is derived from the property of perfect code. Consequently, two methods of fast searching candidate codewords are proposed, both of which only perform the algebraic hard decision decoder once, rather than iterative decoding of Chase-like algorithm. With the set of the possible codewords, the most likely one is chosen as an output codeword based on the correlation metric. In comparison to Chase-2 algorithm, simulation results over the AWGN channel reveal the decoding times of the proposed algorithm equipped with codeword matching and syndrome-group search are reduced by 25% and 75%, respectively. In terms of the percentage of correct decoding, it turns out that the proposed algorithm outperforms Chase-2 algorithm, especially in the error-prone transmission environment. These favorable results demonstrate that the new algorithm is beneficial to implement in practice.
AbstractList A novel and efficient algorithm for decoding the (23, 12, 7) Golay code with the five-error correcting capability is developed. Core to the key idea is innovatively utilizing the relationship of syndromes among error patterns, which is derived from the property of perfect code. Consequently, two methods of fast searching candidate codewords are proposed, both of which only perform the algebraic hard decision decoder once, rather than iterative decoding of Chase-like algorithm. With the set of the possible codewords, the most likely one is chosen as an output codeword based on the correlation metric. In comparison to Chase-2 algorithm, simulation results over the AWGN channel reveal the decoding times of the proposed algorithm equipped with codeword matching and syndrome-group search are reduced by 25% and 75%, respectively. In terms of the percentage of correct decoding, it turns out that the proposed algorithm outperforms Chase-2 algorithm, especially in the error-prone transmission environment. These favorable results demonstrate that the new algorithm is beneficial to implement in practice.
Author Lee, Hung-Peng
Chang, Hsin-Chiu
Chu, Shao-I
Author_xml – sequence: 1
  givenname: Hung-Peng
  surname: Lee
  fullname: Lee, Hung-Peng
  email: hpl@fotech.edu.tw
  organization: Dept. of Information Science and Information Engineering, Fortune Institute of Technology, Kaohsiung City 831, Taiwan, ROC
– sequence: 2
  givenname: Shao-I
  surname: Chu
  fullname: Chu, Shao-I
  organization: Dept. of Electronic Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City 807, Taiwan, ROC
– sequence: 3
  givenname: Hsin-Chiu
  surname: Chang
  fullname: Chang, Hsin-Chiu
  organization: Dept. of Information Science and Information Engineering, Fortune Institute of Technology, Kaohsiung City 831, Taiwan, ROC
BookMark eNp9kMFKAzEQhoNUsK0-gLccFbrrJNlNdvGkpVah4EXPISYTTambkqyFvr271LOnOQzfP_98MzLpYoeEXDMoGTB5ty1Dl0sOTJSgShD8jExZo3ghecsmZArAoQBe1xdklvMWACol5ZQ8rrwPNmDXU4c2utB90uhp_4X0hosFZXxB1S1dx5050mGP9GdP-0h9OCDFlGLKl-Tcm13Gq785J-9Pq7flc7F5Xb8sHzaFZbLqi0aJ8ahrKlE5W6OrK-4VYwwMWmMlDHWNw4-WQeVRNFhzAAXSClXXjWnFnLBTrk0x54Re71P4NumoGehRgt7qQYIeJWhQepAwMPcnBodih4BJ5_FZiy4ktL12MfxD_wLbeWLT
Cites_doi 10.1109/TIT.1987.1057262
10.1049/iet-com:20080037
10.1080/00207729508929077
10.1109/TIT.1964.1053649
10.1109/TIT.1972.1054746
10.1002/ett.1491
10.1016/j.ins.2012.02.020
10.1109/GLOCOM.2005.1577867
10.1016/j.ins.2010.08.015
ContentType Journal Article
Copyright 2013 Elsevier Inc.
Copyright_xml – notice: 2013 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.ins.2013.07.032
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Library & Information Science
EISSN 1872-6291
EndPage 178
ExternalDocumentID 10_1016_j_ins_2013_07_032
S0020025513005434
GroupedDBID --K
--M
--Z
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
AXJTR
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
IHE
J1W
JJJVA
KOM
LG9
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SSB
SSD
SST
SSV
SSW
SSZ
T5K
TN5
TWZ
WH7
XPP
ZMT
~02
~G-
1OL
29I
77I
9DU
AAAKG
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABEFU
ABWVN
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADJOM
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AFFNX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FEDTE
FGOYB
HLZ
HVGLF
HZ~
H~9
R2-
SBC
SDS
SEW
UHS
WUQ
YYP
ZY4
~HD
ID FETCH-LOGICAL-c164t-8730047d8434dc5ed542f71110aecac60187adeb9104fe38e5200706c37558a93
ISSN 0020-0255
IngestDate Sat Nov 29 06:24:51 EST 2025
Fri Feb 23 02:23:15 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Golay code
Soft-decoding
Error pattern
Syndrome
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c164t-8730047d8434dc5ed542f71110aecac60187adeb9104fe38e5200706c37558a93
PageCount 9
ParticipantIDs crossref_primary_10_1016_j_ins_2013_07_032
elsevier_sciencedirect_doi_10_1016_j_ins_2013_07_032
PublicationCentury 2000
PublicationDate 2013-12-20
PublicationDateYYYYMMDD 2013-12-20
PublicationDate_xml – month: 12
  year: 2013
  text: 2013-12-20
  day: 20
PublicationDecade 2010
PublicationTitle Information sciences
PublicationYear 2013
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Chu, Lee, Chang (b0010) 2011; 22
Kasami (b0030) 1964; 10
Lin, Truong, Su, Shih, Dubney (b0045) 2009; 3
Van Trees (b0070) 1968
W.K. Su, P.Y. Shih, T.C. Lin, T.K. Truong, Decoding the Extended Binary Golay Code by an Iterative Invert-One-Bit Scheme, in: 2008 11th IEEE International Conference on Communication Technology (ICCT 2008), Hangzhou, China, 2008, pp. 429–431.
G. Dubney, I.S. Reed, Decoding the (23, 12, 7) Golay code using bit-error probability estimates, in: Proceedings of IEEE Global Telecommunications Conference, Globecom’05, St. Louis, Missouri, 3, 2005, pp. 1325–1330.
Lu, Wuu, Cheng, Lu (b0050) 1995; 26
Chase (b0005) 1972; 18
Wicker (b0075) 1995
Elia (b0020) 1987; 33
Reed, Yin, Truong, Holmes (b0055) 1990; 137
Lin, Chang, Lee, Truong (b0035) 2010; 180
Golay (b0025) 1949; 37
W.K. Su, P.Y. Shih, T.C. Lin, T.K. Truong, G. Dubney, On soft-decoding of the (24, 12, 8) Golay code, in: IEEE TENCON 2007, Taipei, Taiwan, ROC, 2007, pp. 1–4.
Lin, Lee, Chang, Truong (b0040) 2012; 197
Elia (10.1016/j.ins.2013.07.032_b0020) 1987; 33
Lin (10.1016/j.ins.2013.07.032_b0040) 2012; 197
Chase (10.1016/j.ins.2013.07.032_b0005) 1972; 18
Lu (10.1016/j.ins.2013.07.032_b0050) 1995; 26
Kasami (10.1016/j.ins.2013.07.032_b0030) 1964; 10
Wicker (10.1016/j.ins.2013.07.032_b0075) 1995
Lin (10.1016/j.ins.2013.07.032_b0035) 2010; 180
10.1016/j.ins.2013.07.032_b0015
Lin (10.1016/j.ins.2013.07.032_b0045) 2009; 3
Chu (10.1016/j.ins.2013.07.032_b0010) 2011; 22
10.1016/j.ins.2013.07.032_b0065
Reed (10.1016/j.ins.2013.07.032_b0055) 1990; 137
Golay (10.1016/j.ins.2013.07.032_b0025) 1949; 37
10.1016/j.ins.2013.07.032_b0060
Van Trees (10.1016/j.ins.2013.07.032_b0070) 1968
References_xml – reference: W.K. Su, P.Y. Shih, T.C. Lin, T.K. Truong, G. Dubney, On soft-decoding of the (24, 12, 8) Golay code, in: IEEE TENCON 2007, Taipei, Taiwan, ROC, 2007, pp. 1–4.
– volume: 37
  start-page: 637
  year: 1949
  ident: b0025
  article-title: Notes on digital coding
  publication-title: Proceedings IEEE
– volume: 10
  start-page: 134
  year: 1964
  end-page: 139
  ident: b0030
  article-title: A decoding procedure for multiple-error correction cyclic codes
  publication-title: IEEE Transaction on Information Theory
– volume: 197
  start-page: 215
  year: 2012
  end-page: 222
  ident: b0040
  article-title: A cyclic weight algorithm of decoding the (47, 24, 11) quadratic residue code
  publication-title: Information Sciences
– volume: 137
  start-page: 202
  year: 1990
  end-page: 206
  ident: b0055
  article-title: Decoding the (24, 12, 8) Golay code
  publication-title: Processings IEE
– reference: G. Dubney, I.S. Reed, Decoding the (23, 12, 7) Golay code using bit-error probability estimates, in: Proceedings of IEEE Global Telecommunications Conference, Globecom’05, St. Louis, Missouri, 3, 2005, pp. 1325–1330.
– reference: W.K. Su, P.Y. Shih, T.C. Lin, T.K. Truong, Decoding the Extended Binary Golay Code by an Iterative Invert-One-Bit Scheme, in: 2008 11th IEEE International Conference on Communication Technology (ICCT 2008), Hangzhou, China, 2008, pp. 429–431.
– volume: 18
  start-page: 170
  year: 1972
  end-page: 182
  ident: b0005
  article-title: Class of algorithms for decoding block codes with channel measurement information
  publication-title: IEEE Transactions on Information Theory
– volume: 3
  start-page: 232
  year: 2009
  end-page: 238
  ident: b0045
  article-title: Decoding of the (24, 12, 8) extended Golay code up to four errors
  publication-title: IET Communications
– volume: 22
  start-page: 388
  year: 2011
  end-page: 395
  ident: b0010
  article-title: Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability
  publication-title: European Transactions on Telecommunications
– volume: 26
  start-page: 937
  year: 1995
  end-page: 945
  ident: b0050
  article-title: Fast algorithm for decoding the (23,12) binary Golay code with four-error-correcting capability
  publication-title: International Journal of Systems Science
– year: 1968
  ident: b0070
  article-title: Detection, Estimation, and Modulation Theory, Part 1
– volume: 180
  start-page: 4729
  year: 2010
  end-page: 4736
  ident: b0035
  article-title: On the decoding of the (24, 12, 8) Golay code
  publication-title: Information Sciences
– year: 1995
  ident: b0075
  article-title: Error Control Systems for Digital Communication and Storage
– volume: 33
  start-page: 150
  year: 1987
  end-page: 151
  ident: b0020
  article-title: Algebraic decoding of the (23, 12, 7) Golay codes
  publication-title: IEEE Transaction on Information Theory
– volume: 33
  start-page: 150
  issue: 1
  year: 1987
  ident: 10.1016/j.ins.2013.07.032_b0020
  article-title: Algebraic decoding of the (23, 12, 7) Golay codes
  publication-title: IEEE Transaction on Information Theory
  doi: 10.1109/TIT.1987.1057262
– volume: 3
  start-page: 232
  issue: 2
  year: 2009
  ident: 10.1016/j.ins.2013.07.032_b0045
  article-title: Decoding of the (24, 12, 8) extended Golay code up to four errors
  publication-title: IET Communications
  doi: 10.1049/iet-com:20080037
– volume: 26
  start-page: 937
  issue: 4
  year: 1995
  ident: 10.1016/j.ins.2013.07.032_b0050
  article-title: Fast algorithm for decoding the (23,12) binary Golay code with four-error-correcting capability
  publication-title: International Journal of Systems Science
  doi: 10.1080/00207729508929077
– volume: 10
  start-page: 134
  issue: 2
  year: 1964
  ident: 10.1016/j.ins.2013.07.032_b0030
  article-title: A decoding procedure for multiple-error correction cyclic codes
  publication-title: IEEE Transaction on Information Theory
  doi: 10.1109/TIT.1964.1053649
– year: 1968
  ident: 10.1016/j.ins.2013.07.032_b0070
– volume: 37
  start-page: 637
  year: 1949
  ident: 10.1016/j.ins.2013.07.032_b0025
  article-title: Notes on digital coding
  publication-title: Proceedings IEEE
– year: 1995
  ident: 10.1016/j.ins.2013.07.032_b0075
– volume: 18
  start-page: 170
  issue: 1
  year: 1972
  ident: 10.1016/j.ins.2013.07.032_b0005
  article-title: Class of algorithms for decoding block codes with channel measurement information
  publication-title: IEEE Transactions on Information Theory
  doi: 10.1109/TIT.1972.1054746
– volume: 22
  start-page: 388
  issue: 7
  year: 2011
  ident: 10.1016/j.ins.2013.07.032_b0010
  article-title: Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability
  publication-title: European Transactions on Telecommunications
  doi: 10.1002/ett.1491
– volume: 197
  start-page: 215
  year: 2012
  ident: 10.1016/j.ins.2013.07.032_b0040
  article-title: A cyclic weight algorithm of decoding the (47, 24, 11) quadratic residue code
  publication-title: Information Sciences
  doi: 10.1016/j.ins.2012.02.020
– volume: 137
  start-page: 202
  year: 1990
  ident: 10.1016/j.ins.2013.07.032_b0055
  article-title: Decoding the (24, 12, 8) Golay code
  publication-title: Processings IEE
– ident: 10.1016/j.ins.2013.07.032_b0060
– ident: 10.1016/j.ins.2013.07.032_b0065
– ident: 10.1016/j.ins.2013.07.032_b0015
  doi: 10.1109/GLOCOM.2005.1577867
– volume: 180
  start-page: 4729
  issue: 23
  year: 2010
  ident: 10.1016/j.ins.2013.07.032_b0035
  article-title: On the decoding of the (24, 12, 8) Golay code
  publication-title: Information Sciences
  doi: 10.1016/j.ins.2010.08.015
SSID ssj0004766
Score 2.066087
Snippet A novel and efficient algorithm for decoding the (23, 12, 7) Golay code with the five-error correcting capability is developed. Core to the key idea is...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 170
SubjectTerms Error pattern
Golay code
Soft-decoding
Syndrome
Title Efficient decoding of the (23, 12, 7) Golay code up to five errors
URI https://dx.doi.org/10.1016/j.ins.2013.07.032
Volume 253
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6291
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004766
  issn: 0020-0255
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg4wAHBAPEgCEfEAKySPFHauc4qkKH0LTDQL1Fie1o7SGp-oHGf897sZOGwSR24OJWluq2eT-9L7_3e4S8EZwVVlc8FgU3sSxHLi4TVsWMlZlwRmrXUgp9_6rOzvRslp2Hjut1O05A1bW-usqW_1XUsAfCxtbZW4i7PxQ24D0IHVYQO6z_JPhJSwqBV_wWQksbqprRvwRnEgkUxhHjuGIWIPoMoe3PCBvbo-0SHdEKS4ncatWEa55FV-retzlGwWr23ngo5pmC3ojPXTCFftJUm1y9LJr4dLcZMtTT9byOx5fz7TDxwAQWcfBkqEwh8sSQZKhMeSoG6pD5oSDBsjI_rOcPpe3zBwuINJA_nYmWTTVkPX8jyL5muPpywq5SbZHDETkekScqhyPukn2u0gy03f7J6WT2Zdcxq_wtdvcXuvvutvLv2u_4u8cy8EIuHpGHIXygJ17sj8kdVx-QBwNSyQNyFFpR6Fs6EBoNSvwJ-dgDhHYAoU1FASD0HRfHlPFjqt7TFhgUgUG3S7ppKAKDemA8Jd8-TS7G0zhM0ogNhMMbMHlIrKaslkJakzqbSl4pMHNJ4UxhRjiZsbCuBN9RVk5oh2RcKhkZodJUF5l4RvbqpnbPCTVpqbW1XBbGSm1MafVIGHhNjbOizA7Jh-5p5UtPmJLfKJ9DIrvnmQfsek8uB2zc_LEXt_mOl-T-Dr2vyN5mtXVH5J75sZmvV68DMH4B6cRuvA
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+decoding+of+the+%2823%2C+12%2C+7%29+Golay+code+up+to+five+errors&rft.jtitle=Information+sciences&rft.au=Lee%2C+Hung-Peng&rft.au=Chu%2C+Shao-I&rft.au=Chang%2C+Hsin-Chiu&rft.date=2013-12-20&rft.issn=0020-0255&rft.volume=253&rft.spage=170&rft.epage=178&rft_id=info:doi/10.1016%2Fj.ins.2013.07.032&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ins_2013_07_032
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon