Structured LDPC codes from permutation matrices free of small trapping sets

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

• Publication year

  2010

• Venue

  2010 IEEE Information Theory Workshop

• Publication date

  2010-04-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/CIG.2010.5592767arXiv 1004.1198
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Instanton-based techniques for analysis and reduction of error floors of LDPC codes

  2009cited by this paper
• Trapping set ontology

  2009cited by this paper
• Construction of high-girth QC-LDPC codes

  2008cited by this paper
• Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

  2007cited by this paper
• Analysis of Absorbing Sets for Array-Based LDPC Codes

  2007cited by this paper
• Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$

  2007cited by this paper
• Error Floors of LDPC Codes on the Binary Symmetric Channel

  2006cited by this paper
• Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices

  2006cited by this paper
• Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

  2006cited by this paper
• Regular and irregular progressive edge-growth tanner graphs

  2005cited by this paper
• Shortened Array Codes of Large Girth

  2005cited by this paper
• High-rate girth-eight low-density parity-check codes on rectangular integer lattices

  2004influential reference
• Low-Density Parity-Check Codes

  2004cited by this paper
• Near-Shannon-limit quasi-cyclic low-density parity-check codes

  2004cited by this paper
• Near Shannon limit quasi-cyclic low-density parity-check codes

  2003cited by this paper
• Error Floors of LDPC Codes

  2003cited by this paper
• A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols

  2003cited by this paper
• Combinatorial constructions of low-density parity-check codes for iterative decoding

  2002cited by this paper
• Combinatorial constructions of low-density parity check codes for iterative decoding

  2002cited by this paper
• Low-density parity-check codes based on finite geometries: A rediscovery and new results

  2001cited by this paper
• A Class of Group-Structured LDPC Codes

  2001cited by this paper

• An Efficient Algorithm for Counting Cycles in QC and APM LDPC Codes

  2023cites this paper
• LIAD: A Method for Extending the Effective Time of 3-D TLC NAND Flash Hard Decision

  2023cites this paper
• A Number Theoretic Approach to Cycles in LDPC Codes

  2022cites this paper
• Construction of Binary and Nonbinary LDPC-like Codes from Kernel Codes

  2016cites this paper
• High-performance binary and non-binary Low-density parity-check codes based on affine permutation matrices

  2015cites this paper
• LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing

  2013cites this paper
• The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes

  2012cites this paper
• Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity

  2012cites this paper
• LDPC Decoding with Limited-Precision Soft Information in Flash Memories

  2012cites this paper
• Absorbing Set Analysis of LDPC Codes and Read-Channel Quantization in Flash Memory

  2012cites this paper
• The Cycle Consistency Matrix Approach to LDPC Absorbing Sets in Separable Circulant-Based Codes

  2012cites this paper
• Approach to the construction of regular low-density parity-check codes from group permutation matrices

  2012cites this paper
• Towards Maximum Likelihood Decoding of Finite Length LDPC Codes via Iterative Decoder Diversity

  2012cites this paper
• Title Absorbing Set Distributions , Quantization and Practical Message Passing Decoders

  2012cites this paper
• Décodeurs Haute Performance et Faible Complexité pour les codes LDPC Binaires et Non-Binaires

  2012cites this paper
• Absorbing Set Distributions, Quantization and Practical Message Passing Decoders

  2012cites this paper
• Absorbing Set Distributions, Quantization and Practical

  2012cites this paper
• Mutual-Information Optimized Quantization for LDPC Decoding of Accurately Modeled Flash Data

  2012cites this paper
• Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets

  2012cites this paper
• Construction of One-Coincidence Sequence Quasi-Cyclic LDPC Codes of Large Girth

  2012cites this paper
• Coding for Correcting Insertions and Deletions in Bit-Patterned Media Recording

  2011cites this paper
• Absorbing set spectrum approach for practical code design

  2011cites this paper
• Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization

  2011cites this paper
• Performance of LDPC codes in wideband shortwave channel

  2011cites this paper
• Asymptotic Distribution of Absorbing Sets and Fully Absorbing Sets for Regular Sparse Code Ensembles

  2011cites this paper
• Performance of LDPCC-MC-CDMA in wideband shortwave channel

  2011cites this paper
• LDPC absorbing sets, the null space of the cycle consistency matrix, and Tanner's constructions

  2011cites this paper
• Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix

  2011cites this paper
• Achieving flexibility in LDPC code design by absorbing set elimination

  2011cites this paper
• Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders

  2011cites this paper
• Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets

  2010cites this paper