2012/05/26 by Hassan Mehri, Mehri, Hassan, Mohammad Reza Sadeghi +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Combinatorics (math.CO) #Cryptography and Security (cs.CR) #Error Correcting Code Techniques #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.1205.5863
arxiv created 2012/05/26 · openalex publication_date 2012/05/26 · arxiv updated 2012/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Low density generator matrix (LDGM) codes have an acceptable performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively good performance and low encoding and decoding complexity. To construct such lattices, Construction D is applied to a set of generator vectors of a class of LDGM codes. Bounds on the minimum distance and the coding gain of the corresponding lattices and a corollary for the cross sections and projections of these lattices are provided. The progressive edge growth (PEG) algorithm is used to construct a class of binary codes to generate the corresponding lattice. Simulation results confirm the acceptable performance of these class of lattices.