Structured LDPC Codes from Permutation Matrices Free of Small Trapping\n Sets

2010/04/07 by Dung Viet Nguyen, Bane Vasić, Nguyen, Dung Viet +5 · 2 citations
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.1198

openalex publication_date 2010/04/07 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

This paper introduces a class of structured lowdensity parity-check (LDPC)\ncodes whose parity check matrices are arrays of permutation matrices. The\npermutation matrices are obtained from Latin squares and form a finite field\nunder some matrix operations. They are chosen so that the Tanner graphs do not\ncontain subgraphs harmful to iterative decoding algorithms. The construction of\ncolumn-weight-three codes is presented. Although the codes are optimized for\nthe Gallager A/B algorithm over the binary symmetric channel (BSC), their error\nperformance is very good on the additive white Gaussian noise channel (AWGNC)\nas well.\n

Citations

• Regular and irregular progressive edge-growth tanner graphs

Cited by

• The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes
• Mutual-Information Optimized Quantization for LDPC Decoding of Accurately Modeled Flash Data

Related

• LDPC Codes from Latin Squares Free of Small Trapping Sets
• New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier
• High Rate LDPC Codes from Difference Covering Arrays
• Eliminating Trapping Sets in Low-Density Parity Check Codes by using Tanner Graph Covers
• A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings