Decoding the (24,12,8) Golay code
作者:
I.S.Reed,
X.Yin,
T.K.Truong,
J.K.Holmes,
期刊:
IEE Proceedings E (Computers and Digital Techniques)
(IET Available online 1990)
卷期:
Volume 137,
issue 3
页码: 202-206
年代: 1990
DOI:10.1049/ip-e.1990.0025
出版商: IEE
数据来源: IET
摘要:
A simplified procedure, called the shift-search method, is developed to decode the three possible errors in a (23,12,7) Golay codeword. The algebraic decoding algorithm developed recently by Elia is compared with this algorithm. A computer simulation shows that both algorithms are modular, regular and naturally suitable for either VLSI or software implementation. Both of these algorithms decode efficiently the 1/2-rate (24,12) Golay code for correcting three errors and detecting four errors. The algebraic technique is a slightly faster algorithm in software than the shift-search procedure.
点击下载:
PDF
(523KB)
返 回