چکیده مقاله
Recently, some classes of quasi cyclic QC low density parity check LDPC codes have been constructed based on different explicit methods In this paper, by introducing a strictly increasing sequence with size as the second row of the exponent matrix, girth 8 3,L QC LDPC codes are obtained for any row weight L ≥ 4 The results show, the constructed codes are shorter than perviously codes by other explicit methods with the same girth
کلیدواژهها
QC-LDPC codes explicit constructions girth exponent matrix. QC LDPC codes exponent matrix
نویسندگان
Mohammad Gholami
Department of Mathematics University of Shahrekord, Shahrekord, Iran
Marjan Majdzade
Department of Mathematics University of Shahrekord, Shahrekord, Iran
شیوه ارجاع
Gholami, Mohammad and Majdzade, Marjan,1398,A Construction of QC LDPC Codes by a Greedy Algorithm,The 5th International Conference on Science & Technology with Sustainable development approach,Shiraz
ارائهشده در
مجموعه مقالات پنجمین همایش بین المللی علوم و تکنولوژی با رویکرد توسعه پایدار1 شهریور 1398 · شیراز