Golay码的快速译码  

Fast Decoding of Golay Codes

作　　者：马建峰[1] 王育民[1] 

机构地区：[1]西安电子科技大学

出　　处：《通信学报》1996年第4期130-135,共6页Journal on Communications

基　　金：国家自然科学基金

摘　　要：本文利用Ｇｏｌａｙ码的代数结构给出了二元（２３，１２，７）Ｇｏｌａｙ码及三元（１１，６，５）Ｇｏｌａｙ码新的译码算法。对于二元Ｇｏｌａｙ码，所提的算法的最坏时间复杂性为５３４次ｍｏｄ２加法，比已知的同类译码算法的时间复杂性都小；平均时间复杂性为２２４次ｍｏｄ２加法，比目前已知的最快的译码算法的平均时间复杂性２７９次ｍｏｄ２加法还要小。对于三元Ｇｏｌａｙ码，所提算法的最坏时间复杂性为１２３次ｍｏｄ３加法，平均时间复杂性为８５次ｍｏｄ３加法，比同类的算法都快。此外，这里给出的算法结构简单，易于实现。Two novel decoding algorithms are presented based on the algebraic structures of the binary (23, 12, 7)Golay code and the ternary(11, 6, 5)Golay code, for the binary Golay code, the proposed algorithm has the worst time complexity 534 mod2 additions, which is less than that of the algorithms available, the average time complexity 224 mod2 additions, which is less than that,279 mod 2 additions, of the known fastest decoding algorithm, and for the ternary Golay code, the proposed algorithm has the worst time complexity 123 mod3 additions. the average time comlexity 85 mod3 additions, which are less than that of the algorithms available. In addition, the algorithms are simple in structure, and easy in implementation.

关 键 词：GOLAY码 译码 代数结构 信道编码 

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