2016/05/24 by Meng Zhao, Zhao, Meng, Changli Ma +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Combinatorics (math.CO) #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1605.07273
openalex publication_date 2016/05/24 · arxiv created 2016/05/25 · arxiv updated 2016/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on \mathbbSn(\mathbbFq), the space of n× n symmetric matrices over \mathbbFq. Using this method, we obtain two classes of binary LDPC codes, \calC(n,q) and \calCT(n,q), both of which have grith 8. Then both the minimum distance and the stopping distance of each class are investigated. It is shown that the minimum distance and the stopping distance of \calCT(n,q) are both 2q. As for \calC(n,q), we determine the minimum distance and the stopping distance for some special cases and obtain the lower bounds for other cases.