Leech格的限界距离译码

本文利用将Ｌｅｅｃｈ格投影于ＧＦ（４）得到（６，３，４）Ｈｅｘａｃｏｄｅｘ这一性质，提出一种新的Ｌｅｅｃｈ格的限界距离译码算法，复杂度为最多１１５１次，最少５７５次，平均９１１次实数运算，而目前已知最快的ＢＤ译码算法复杂度为最多１００７次，最少９１１次运算，平均９５３次，新算法在平均和最少复杂度方面有所降低，计算机模拟表明新算法相对于最在似然译码仅有０．０２ｄＢ的编码增益损失，而文献（１０）中算法

Bounded Distance Decoding of the Leech Lattice

Based on the fact that the projection of the Leech lattice on GF(4) is the (6, 3, 4)Hexacode,a new bounded distance decoding algorithm is presented. its complexity is at most 1151, at least 575,and 911 real operations on the average,as compared to the fastest BD algorithm shown in10),whose complexity is at most 1007,at least 911 and 959 on the average. The computer simulation shows that the loss in coding gain of our algorithm relative to maximum likelihood decoding algorithm is only about 0. 02dB,as compared to 0. 17dB for the algorithm of 10]