2012/03/15 by J. Harshan, Harshan, J., Emanuele Viterbo +4 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1203.3282
30 pages with 10 figures and 1 table
openalex publication_date 2012/03/15 · arxiv created 2013/01/08 · arxiv updated 2013/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex BW lattice codes from linear codes over polynomial rings, and show that the proposed construction provides an explicit method of bit-labeling complex BW lattice codes. To decode the code, we adapt the low-complexity sequential BW lattice decoder (SBWD) recently proposed by Micciancio and Nicolosi. First, we study the error performance of SBWD in decoding the infinite lattice, wherein we analyze the noise statistics in the algorithm, and propose a new upper bound on its error performance. We show that the SBWD is powerful in making correct decisions well beyond the packing radius. Subsequently, we use the SBWD to decode lattice codes through a novel noise-trimming technique. This is the first work that showcases the error performance of SBWD in decoding BW lattice codes of large block lengths.