Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs. - Anthony Gómez-Fonseca; Roxana Smarandache; David G. M. Mitchell (ISTC, 2021)

Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC Codes. - Roxana Smarandache; Anthony Gómez-Fonseca; David G. M. Mitchell (ISIT, 2022)

On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices. - Anthony Gómez-Fonseca; Roxana Smarandache; David G. M. Mitchell (ISIT, 2023)

Using Partial Orthomorphisms to Construct Short Quasi-Cyclic LDPC Codes with Girth at Least 6. - Henry Chimal-Dzul; Anthony Gómez-Fonseca (ISTC, 2023)

A Low Complexity PEG-like Algorithm to Construct Quasi-Cyclic LDPC Codes. - Anthony Gómez-Fonseca; Roxana Smarandache; David G. M. Mitchell (ISTC, 2023)

An Efficient Strategy to Count Cycles in the Tanner Graph of Quasi-Cyclic LDPC Codes. - Anthony Gómez-Fonseca; Roxana Smarandache; David G. M. Mitchell (IEEE J. Sel. Areas Inf. Theory, 2023)

Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding. - Roxana Smarandache; Anthony Gómez-Fonseca; David G. M. Mitchell (ISIT, 2024)