论文标题
关于Barnes-Wall Lattices的解码
On the decoding of Barnes-Wall lattices
论文作者
论文摘要
我们根据其平方结构为Barnes-Wall晶格提供了新的有效的递归解码器。对新解码器的分析揭示了晶格维度的准季度复杂性，并且在列表大小中的准线性复杂性。该错误率显示为64和128中的通用下限接近。
We present new efficient recursive decoders for the Barnes-Wall lattices based on their squaring construction. The analysis of the new decoders reveals a quasi-quadratic complexity in the lattice dimension and a quasi-linear complexity in the list-size. The error rate is shown to be close to the universal lower bound in dimensions 64 and 128.
