2010/04/10 by Mohammad‐Reza Sadeghi, Mohammad-Reza Sadeghi, Sadeghi, Mohammad-Reza +2
Computer Science · Mathematics · #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1004.1749
This paper has been withdrawn by the author due to an error
openalex publication_date 2010/04/10 · arxiv created 2012/04/11 · arxiv updated 2012/04/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform very well under iterative decoding algorithm. In this work, we focus on an ensemble of regular LDPC lattices. We produce and investigate an ensemble of LDPC lattices with known properties. It is shown that these lattices are sphere-bound-achieving and capacity-achieving. As byproducts we find the minimum distance, coding gain, kissing number and an upper bound for probability of error for this special ensemble of regular LDPC lattices.