Designing LDPC Codes without small trapping sets by using Tanner Graph Covers

2007 ◽  
Author(s):  
Milos Ivkovic ◽  
Shashi Kiran Chilappagari ◽  
Bane Vasic
Keyword(s):  
Ldpc Codes ◽  
Trapping Sets ◽  
Tanner Graph

Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph

2016 ◽  
Vol 20 (9) ◽  
pp. 1713-1716 ◽  
Author(s):  
Hossein Falsafain ◽  
Sayyed Rasoul Mousavi
Keyword(s):  
Trapping Sets ◽  
Tanner Graph

Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets

2019 ◽  
Vol 23 (11) ◽  
pp. 1904-1908 ◽  
Author(s):  
Sima Naseri ◽  
Amir H. Banihashemi
Keyword(s):  
Ldpc Codes ◽  
Trapping Sets

scholarly journals On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

2010 ◽  
Vol 56 (4) ◽  
pp. 1600-1611 ◽  
Author(s):  
S.K. Chilappagari ◽  
Dung Viet Nguyen ◽  
B. Vasic ◽  
M.W. Marcellin
Keyword(s):  
Error Correction ◽  
Ldpc Codes ◽  
Trapping Sets ◽  
Error Correction Capability

scholarly journals On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes

2014 ◽  
Vol 60 (9) ◽  
pp. 5188-5203 ◽  
Author(s):  
Mehdi Karimi ◽  
Amir H. Banihashemi
Keyword(s):  
Ldpc Codes ◽  
Trapping Sets

scholarly journals LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs

2021 ◽  
Author(s):  
Shyam Saurabh
Keyword(s):  
Block Design ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Finite Geometries ◽  
Group Divisible Designs ◽  
Tanner Graph ◽  
Group Divisible ◽  
Check Matrix ◽  
Balanced Incomplete Block ◽  
Resolvable Group

<p>Structured LDPC codes have been constructed using balanced incomplete block (BIB) designs, resolvable BIB designs, mutually orthogonal Latin rectangles, partial geometries, group divisible designs, resolvable group divisible designs and finite geometries. Here we have constructed LDPC codes from <i>α </i>–<b> </b>resolvable BIB and Group divisible designs. The sub–matrices of incidence matrix of such block design are used as a parity – check matrix of the code which satisfy row – column constraint. Here the girth of the proposed code is at least six and the corresponding LDPC code (or Tanner graph) is free of 4– cycles. </p>

Sign in / Sign up

Export Citation Format

Share Document