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

Standard

A simple decoding algorithm for the [24,12,8] extended Golay code. / Boyarinov, I.; Martin, Ian; Honary, Bahram.
Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy: IEEE, 2000. p. 394.

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

Harvard

Boyarinov, I, Martin, I & Honary, B 2000, A simple decoding algorithm for the [24,12,8] extended Golay code. in Information Theory, 2000. Proceedings. IEEE International Symposium on. IEEE, Sorrento, Italy, pp. 394, IEEE International Symposium on Information Theory, Sorrento, Italy, 25/06/00. https://doi.org/10.1109/ISIT.2000.866692

APA

Boyarinov, I., Martin, I., & Honary, B. (2000). A simple decoding algorithm for the [24,12,8] extended Golay code. In Information Theory, 2000. Proceedings. IEEE International Symposium on (pp. 394). IEEE. https://doi.org/10.1109/ISIT.2000.866692

Vancouver

Boyarinov I, Martin I, Honary B. A simple decoding algorithm for the [24,12,8] extended Golay code. In Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy: IEEE. 2000. p. 394 doi: 10.1109/ISIT.2000.866692

Author

Boyarinov, I. ; Martin, Ian ; Honary, Bahram. / A simple decoding algorithm for the [24,12,8] extended Golay code. Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy : IEEE, 2000. pp. 394

Bibtex

@inproceedings{660bf771ff9240a0ad63ed8c00b5cbdf,
title = "A simple decoding algorithm for the [24,12,8] extended Golay code",
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.",
author = "I. Boyarinov and Ian Martin and Bahram Honary",
year = "2000",
month = jun,
doi = "10.1109/ISIT.2000.866692",
language = "English",
isbn = "0-7803-587-0",
pages = "394",
booktitle = "Information Theory, 2000. Proceedings. IEEE International Symposium on",
publisher = "IEEE",
note = "IEEE International Symposium on Information Theory ; Conference date: 25-06-2000 Through 30-06-2000",

}

RIS

TY - GEN

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

AU - Boyarinov, I.

AU - Martin, Ian

AU - Honary, Bahram

PY - 2000/6

Y1 - 2000/6

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

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

U2 - 10.1109/ISIT.2000.866692

DO - 10.1109/ISIT.2000.866692

M3 - Conference contribution/Paper

SN - 0-7803-587-0

SP - 394

BT - Information Theory, 2000. Proceedings. IEEE International Symposium on

PB - IEEE

CY - Sorrento, Italy

T2 - IEEE International Symposium on Information Theory

Y2 - 25 June 2000 through 30 June 2000

ER -