Autor:	Mehri, Hassan
Rok vydání:	2012
Předmět:	Computer Science - Cryptography and Security Computer Science - Information Theory Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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. Comment: 10 pages, 1 figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1201.3982 Zobrazit plný text záznamu View this record from Arxiv