@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	pages = {982-989},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	note = {cited By 0},
	pages = {982-989},
	abstract = {Low Density Parity Check Codes (LDPC) are a class of linear error-correcting codes which have shown ability to approach or even to reach the capacity of the transmission channel. This class of code approaches asymptotically the fundamental limit of information theory more than the Turbo Convolutional codes. It{\textquoteright}s ideal for long distance transmission satellite, mobile communications and it{\textquoteright}s also used in storage systems. In this paper, a new method for constructing quasicyclic low density parity-check (QC-LDPC) codes derived from cyclic codes is presented. The proposed method reduces the incidence vectors, by eliminating the conjugates lines in parity-check matrix of the derived cyclic code to construct circulant shifting sub-matrices. In the end, this method produces a large class of regular LDPC codes of quasi-cyclic structure having very low density, high coding rates and Tanner graphs which have no short cycles with girth of at least 6. Performance with computer simulations are also shown in this work for some constructed codes. {\textcopyright} 2006-2018 Asian Research Publishing Network (ARPN).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
