关于32维Barnes-Wal格的有效译码算法

On an efficient decoding algorithm for the 32 dimensional Barnes Wall lattice

本文给出了３２维Ｂａｒｎｅｓ－Ｗａｌ格的一个有效的译码算法，该算法将这个格的译码问题转化为在ＲＭ（２，５）＝（３２，１６，８）码的修正赋权格子图上求最短路径的问题，该算法在最坏情况下的译码时间复杂性为２２７８３次二元运算，小于Ｆｏｒｎｅｙ给出算法的最坏时间复杂性。此外。

An efficient decoding algorithm is presented for the 32 dimensional Barnes Wall lattice,the algorithm transforms the decoding problem of the lattice into the problem of finding the shortest path on the revised trellis diagram with weights of RM(2,5),the time complexity of the algorithm is 22783 binary operations in the worst case,which is less than the worst time complexity of the algorithm proposed by Forney for the lattice,moreover,the algorithm is simple in structure,easy in implementalion.