New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier

2014/02/07 by samadieh, Mehdi, Gholami, Mohammad
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1402.1614

Abstract

In the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with higher girth than other previous constructed codes. Especially we proposed a new method to construct LDPC codes using non fixed shift permutation matrices and full based matrices with higher girth than codes constructed by Fossorier.

Related

• Constructing LDPC Codes from Partition and Latin-Style Splicing
• Structured LDPC Codes from Permutation Matrices Free of Small Trapping\n Sets
• Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
• High Rate LDPC Codes from Difference Covering Arrays
• A method for constructing parity-check matrices of non-binary\n quasi-cyclic LDPC codes