Multiplicatively Repeated Non-Binary LDPC Codes

2010/04/29 by Kenta Kasai, Kasai, Kenta, David Declercq +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1004.5367

openalex publication_date 2010/04/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.

Citations

• Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images

Related

• Min-Max decoding for non binary LDPC codes
• Binary Representaion for Non-binary LDPC Code with Decoder Design
• On Multilevel Coding Schemes Based on Non-Binary LDPC Codes
• Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes
• Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes