Even more efficient soft decoding of the Golay codes

Alexander Vardy; Yair Be'Ery

doi:10.1109/ISIT.1991.695246

Even more efficient soft decoding of the Golay codes

Alexander Vardy, Yair Be'Ery

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	190
Number of pages	1
ISBN (Electronic)	0780300564
DOIs	https://doi.org/10.1109/ISIT.1991.695246
State	Published - 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: 24 Jun 1991 → 28 Jun 1991

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/Territory	Hungary
City	Budapest
Period	24/06/91 → 28/06/91

Access to Document

10.1109/ISIT.1991.695246

Cite this

@inproceedings{2193afd935ef402c973ade14ace74ced,

title = "Even more efficient soft decoding of the Golay codes",

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.",

author = "Alexander Vardy and Yair Be'Ery",

year = "1991",

doi = "10.1109/ISIT.1991.695246",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "190",

booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

address = "ארצות הברית",

}

Vardy, A & Be'Ery, Y 1991, Even more efficient soft decoding of the Golay codes. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695246, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 190, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 24/06/91. https://doi.org/10.1109/ISIT.1991.695246

Even more efficient soft decoding of the Golay codes. / Vardy, Alexander; Be'Ery, Yair.

Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 190 695246 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Even more efficient soft decoding of the Golay codes

AU - Vardy, Alexander

AU - Be'Ery, Yair

PY - 1991

Y1 - 1991

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

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

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

U2 - 10.1109/ISIT.1991.695246

DO - 10.1109/ISIT.1991.695246

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85067508153

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 190

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 24 June 1991 through 28 June 1991

ER -

Even more efficient soft decoding of the Golay codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this