Paper Info
Title
Quasi-cyclic LDPC codes: Construction and rank analysis of their parity-check matrices
Abstract
A construction of binary and non-binary quasi-cyclic (QC)-LDPC codes based on partitions of finite fields of characteristic 2 is proposed. The construction is carried out in the Fourier transform domain. The parity-check matrices of these QC-LDPC codes are arrays of circulant permutation matrices. The ranks of these arrays are analyzed and combinatorial expressions are derived. Example codes are given and simulations show that they perform well over the AWGN channel decoded with message-passing decoding algorithms.
Year
DOI
Venue
2012
10.1109/ITA.2012.6181797
ITA
Keywords
Field
DocType
fourier transforms,finite fields,fourier transform domain,awgn channels,cyclic codes,matrix algebra,parity check matrices,message passing decoding algorithm,channel coding,combinatorial mathematics,awgn channel,binary qc-ldpc code,nonbinary quasicyclic ldpc code,circulant permutation matrix arrays,rank analysis,galois fields,binary codes,parity check codes,decoding,combinatorial expressions,finite field,fourier transform,ldpc code,null space,message passing
Discrete mathematics,Combinatorics,Parity-check matrix,Low-density parity-check code,Matrix (mathematics),Block code,Turbo code,Permutation matrix,Circulant matrix,Linear code,Mathematics
Conference
ISBN
Citations 
PageRank 
978-1-4673-1473-2
2
0.39
References 
Authors
14
4
Name
Order
Citations
PageRank
Keke Liu1486.44
Qin Huang235534.55
Shu Lin323416.88
Khaled A. S. Abdel-Ghaffar4616122.03