Algebraic decoding of the (23,12,7) Golay code
IEEE Transactions on Information Theory
Error control systems for digital communication and storage
Error control systems for digital communication and storage
On the decoding of the (24,12,8) Golay code
Information Sciences: an International Journal
A cyclic weight algorithm of decoding the (47,24,11) quadratic residue code
Information Sciences: an International Journal
A decoding procedure for multiple-error-correcting cyclic codes
IEEE Transactions on Information Theory
Class of algorithms for decoding block codes with channel measurement information
IEEE Transactions on Information Theory
| Hi-index | 0.07 |
A novel and efficient algorithm for decoding the (23, 12, 7) Golay code with the five-error correcting capability is developed. Core to the key idea is innovatively utilizing the relationship of syndromes among error patterns, which is derived from the property of perfect code. Consequently, two methods of fast searching candidate codewords are proposed, both of which only perform the algebraic hard decision decoder once, rather than iterative decoding of Chase-like algorithm. With the set of the possible codewords, the most likely one is chosen as an output codeword based on the correlation metric. In comparison to Chase-2 algorithm, simulation results over the AWGN channel reveal the decoding times of the proposed algorithm equipped with codeword matching and syndrome-group search are reduced by 25% and 75%, respectively. In terms of the percentage of correct decoding, it turns out that the proposed algorithm outperforms Chase-2 algorithm, especially in the error-prone transmission environment. These favorable results demonstrate that the new algorithm is beneficial to implement in practice.