Paper Info
Title
Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Abstract
This paper is concerned with construction of efficiently encodable nonbinary quasi-cyclic LDPC codes based on finite fields. Four classes of nonbinary quasi-cyclic LDPC codes are constructed. Experimental results show that codes constructed perform well with iterative decoding using a fast Fourier transform based q-ary sum-product algorithm and they achieve significant coding gains over Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard- decision Berlekamp-Massey algorithm or algebraic soft-decision Kotter-Vardy algorithm.
Year
DOI
Venue
2008
10.1109/TCOMM.2008.060024
IEEE Transactions on Communications
Keywords
Field
DocType
finite field approach,fast fourier transform,matrix algebra,nonbinary quasi-cyclic ldpc codes,q-ary sum-product algorithm,iterative decoding,parity check codes,fast fourier transforms,construction industry,finite field,reed solomon code,algorithm design and analysis,belief propagation,coding gain,ldpc code,dispersion,galois fields
Discrete mathematics,BCJR algorithm,Concatenated error correction code,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Block code,Turbo code,Algorithm,Reed–Solomon error correction,Tornado code
Journal
Volume
Issue
ISSN
56
4
0090-6778
Citations 
PageRank 
References 
58
2.56
16
Authors
6
Name
Order
Citations
PageRank
Lingqi Zeng149925.43
Lan Lan236422.89
Ying Yu Tai320211.97
Shumei Song41398.49
Shu Lin598572.16
Khaled A. S. Abdel-Ghaffar6616122.03