一种Golay码的快速译码算法

A Fast Decoding Algorithm for Golay Code

本文提出了一种（２４，１２，８）扩展Ｇｏｌａｙ码的新的软判决译码算法，其译一组码字的运算量最多为５０７次二元运算，优于目前已发表的各种算法。我们证明了该算法，并实现了广义最小距离译码。计算机模拟表明在完备译码时其性能与最大似然译码几乎一样。

A new soft decision decoding algorithm for (24, 12,8) extended Golay code is presented,and the complexity of it is at most 507 real additions,which is,to our knowlege,the best among the existing algorihtms. It is proved to be a generalized minimum distance (GMD)algorithm.Computer simulation shows that its performance is almost the same as that of Maximum likelihood decoding(MLD).