Explicit Constructions for Type-1 QC-LDPC Codes with Girth


G. Zhang, R. Mathar,


        Given any JJ (J > 3) square matrix over ZP such that the differences of any two row vectors contain each element in ZP at most once, a class of (3;L)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes is explicitly constructed with lengths PJL2 and girth twelve, where L is any integer satisfying 3 < L J. Simulation results show that the new codes perform very well for moderate rates and lengths.

BibTEX Reference Entry 

	author = {Guohua Zhang and Rudolf Mathar},
	title = "Explicit Constructions for Type-1  QC-LDPC Codes with Girth",
	pages = "460-463",
	journal = "{IEEE} Communications Letters",
	volume = "21",
	number = "3",
	doi =  10.1109/LCOMM.2016.2634022,
	month = Dec,
	year = 2016,
	hsb = RWTH-2017-02431,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.