More efficient soft decoding of the golay codes

Alexander Vardy, Yair Be'ery

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present an algorithm for maximum-likelihood soft decision decoding of the binary (24,12,8) Golay code. The algorithm involves projecting the codewords of the binary Golay code onto the codewords of the (6,3,4) code over GF(4),- the hexacode. The complexity of the proposed algorithm is at most 651 real operations which is, to the best of our knowledge, less than the complexity of any algorithm ever published. Along similar lines the tetracode may be employed for decoding the ternary (12,6,6) Golay code with only 530 real operations. The proposed algorithm also implies a reduction in the number of computations required for decoding of the Leech lattice.

Original languageEnglish
Title of host publicationProceedings - 17th Convention of Electrical and Electronics Engineers in Israel, EEIS 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages31-34
Number of pages4
ISBN (Electronic)0879426780, 9780879426781
DOIs
StatePublished - 1991
Event17th Convention of Electrical and Electronics Engineers in Israel, EEIS 1991 - Tel Aviv, Israel
Duration: 5 Mar 19917 Mar 1991

Publication series

NameProceedings - 17th Convention of Electrical and Electronics Engineers in Israel, EEIS 1991

Conference

Conference17th Convention of Electrical and Electronics Engineers in Israel, EEIS 1991
Country/TerritoryIsrael
CityTel Aviv
Period5/03/917/03/91

Fingerprint

Dive into the research topics of 'More efficient soft decoding of the golay codes'. Together they form a unique fingerprint.

Cite this