By studying the structure of 16 dimension Barnes-Wall lattice and lattices resulting from binary linear block codes and quaternary linear block codes based on Construction A, decoding problem of the lattices can be transformed into the problem of finding the shortest path of trellises accordingly. The time complexities of the decoding algorithms are analyzed.
Forney Jr G D, et al. Efficient modulation for band-limited channels. IEEE J. of Selected Areas in Comm., 1984, SAG2(5): 632-647.[2]Conway J H, Sloane N J A. Soft decoding techniques for codes and lattices, including the Golay codes and the Leech lattices. IEEE Trans. on IT, 1986, IT-32(1): 41-50.[3]Conway J H, Sloane N J A. Sphere Packing, Lattices and Groups. New York: Springer-Verlag, 1988, Chapters 5, 7, 20.[4]Wolf J K. Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. on IT, 1978, IT-24(1): 76-80.[5]阿霍 A V,霍普克罗夫特 J E,厄尔曼 J D著,唐守文译.数据结构与算法.北京:科学出版社,1987, 256-261.[6]马建峰.分组码快速译码算法的研究:[博士论文].西安:西安电子科技大学,1994. 12.[7]Forney Jr G D. Coset codes Part II: Binary lattices and related codes.IEEE Trans. on IT, 1988,[8]IT-34(5): 1152-1187.