DECODING ALGORITHM BASED QN REVISED SYNDROME FOR THE BINARY (23,12,7) GOLAY CODE  

作　　者：马建峰 王育民 

机构地区：[1]Xidian University, Xi'an 710071

出　　处：《Journal of Electronics(China)》1995年第1期33-37,共5页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China

摘　　要：A decoding algorithm based on revised syndromes to decode the binary (23,12,7) Golay code is presented. The algorithm strongly depends on the algebraic properties of the code. For the algorithm, the worst complexity is about 683 mod2 additions, which is less than that of the algorithms available for the code, the average complexity is approximately 319 mod2 additions, which is slightly more than that of Blaum’s algorithm for the code.A decoding algorithm based on revised syndromes to decode the binary (23,12,7) Golay code is presented. The algorithm strongly depends on the algebraic properties of the code. For the algorithm, the worst complexity is about 683 mod2 additions, which is less than that of the algorithms available for the code, the average complexity is approximately 319 mod2 additions, which is slightly more than that of Blaum's algorithm for the code.

关 键 词：BINARY GOLAY CODE Revised SYNDROME DECODING 

分 类 号：TN911[电子电信—通信与信息系统]