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

Boyarinov, I. and Martin, Ian and Honary, Bahram (2000) A simple decoding algorithm for the [24,12,8] extended Golay code. In: Information Theory, 2000. Proceedings. IEEE International Symposium on. IEEE, ITA, p. 394. ISBN 0-7803-587-0

Full text not available from this repository.

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.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
61131
Deposited By:
Deposited On:
13 Feb 2013 14:27
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 05:41