2012/01/19 by Hassan Mehri, Mehri, Hassan
Computer Science · Mathematics · #Combinatorics (math.CO) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.CR #cs.IT #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1201.3982
10 pages, 1 figure
arxiv created 2012/01/19 · arxiv updated 2012/01/20
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding complexity per iteration, in terms of coding gain, label group sizes of the lattice and other factors is derived. We show that iterative decoding of LDGM lattices has a reasonably low complexity such that lattices with dimensions of a few thousands can be easily decoded.