1. Kharin, A.V., Zavertkin, K.N., and Ovinnikov, A.A., Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis, Probl. Peredachi Inf., 2020, vol. 56, no. 2, pp. 82–94 [Probl. Inf. Transm. (Engl. Transl.), 2020, vol. 56, no. 2, pp. 173–184].
2. Richardson, T. and Urbanke, R., Multi-Edge Type LDPC Codes, Tech. Report of Communication Theories Lab. (LTHC), EPFL, Switzerland, 2004, no. LTHC-REPORT-2004-001. Available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.7310.
3. Thorpe, J., Low Density Parity Check (LDPC) Codes Constructed from Protographs, The Interplanetary Network Progress Report of Jet Propulsion Lab., California Inst. of Technology, 2003, no. 42-154. Available at https://ipnpr.jpl.nasa.gov/progress_report/42-154/154C.pdf.
4. Fan, J.L., Array Codes as Low-Density check Codes, in Proc. 2nd Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 4–7, 2000, pp. 543–546.
5. Hu, X.-Y., Eleftheriou, E., and Arnold, D.M., Regular and Irregular Progressive Edge-Growth Tanner Graphs, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 1, pp. 386–398.