Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes and Efficient Encoding

منو

" Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes and Efficient Encoding "

Document Type	:	Latin Dissertation
Language of Document	:	English
Record Number	:	148837
Doc. No	:	ET20629
Main Entry	:	LINGQI ZENG
Title Proper	:	Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes and Efficient Encoding
Note	:	This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract	:	This dissertation presents three algebraic methods for constructing nonbinary low-density parity-check (LDPC) codes whose Tanner graphs has girth at least 6. The ex-perimental results show that these codes perform well under iterative decoding algorithm.Compared with other nonbinary LDPC codes, codes constructed by algebraic methods havequasi-cyclic or cyclic structure and therefore allow efficient encoding. First presented is afinite field approach for constructing two classes of quasi-cyclic LDPC codes. The parity-check matrices of the codes constructed by the finite field approach usually have full row.
Subject	:	Electericl tess
	:	برق
electronic file name	:	TL43769.pdf
Title and statement of responsibility and	:	Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes and Efficient Encoding [Thesis]