Home > Research > Publications & Outputs > A simple decoding algorithm for the [24,12,8] e...
View graph of relations

A simple decoding algorithm for the [24,12,8] extended Golay code

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date06/2000
Host publicationInformation Theory, 2000. Proceedings. IEEE International Symposium on
Place of PublicationSorrento, Italy
PublisherIEEE
Pages394
Number of pages1
ISBN (print)0-7803-587-0
<mark>Original language</mark>English
EventIEEE International Symposium on Information Theory - Sorrento, Italy
Duration: 25/06/200030/06/2000

Conference

ConferenceIEEE International Symposium on Information Theory
Country/TerritoryItaly
CitySorrento
Period25/06/0030/06/00

Conference

ConferenceIEEE International Symposium on Information Theory
Country/TerritoryItaly
CitySorrento
Period25/06/0030/06/00

Abstract

A simple high-speed decoding algorithm for the [24,12,8] extended Golay code, based on the |a+x| b+x|a+b+x| Turyn construction is described. The algorithm can be easily realized in combinational circuits. Futhermore we show that [24,12,8] Golay code can correct simultaneously all patterns of three or fewer random errors as well as certain patterns of quadruple errors such as 4-bit cyclic single-burst and two-dimensional byte errors.