Roxana Smarandache

Professor

Education

B.S., University of Bucharest, Bucharest, 1996
M.S., University of Notre Dame, 1997
Ph.D., University of Notre Dame, 2001

Research Groups

Algebra and Algebraic Geometry, Discrete Math, Operations Research, and Probability

Research Area

Algebra/Applied Algebra/Coding Theory

Bio

Research Interests

My research area is applied (discrete) mathematics. I work on error control coding theory, in particular on algebraic and combinatorial problems that occur when constructing or analyzing codes for reliable transmission (or storage) of information over some noisy channel.

Selected Publications

• R. Smarandache, and D. G. M. Mitchell, “The Number of Cycles of Bi-regular Tanner Graphs in Terms of the Eigenvalues of the Adjacency Matrix”, submitted to IEEE Transactions on Information Theory, Dec. 2025, https://arxiv.org/abs/2601.05340.
• R. Smarandache, and D. G. M. Mitchell, A. Gomez-Fonseca, “Structural Analysis of Generalized Quasi-Cyclic LDPC Codes: Rank, Design, and Generator Matrices,” in IEEE Transactions on Information Theory, vol. 72, no. 1, pp. 253-267, Jan. 2026.
• Gomez-Fonseca, R. Smarandache and D. G. M. Mitchell, “An Efficient Strategy to Count Cycles in the Tanner Graph of Quasi-Cyclic LDPC Codes”, in IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 499-513, 2023.
• R. Smarandache and D. G. M. Mitchell, “A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth”, in IEEE Transactions on Information Theory, vol. 68, no. 9, pp. 5802-5822, Sept. 2022.
• S. Mo, L. Chen, D. J. Costello, D. G. M. Mitchell and R. Smarandache, “Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth”, in IEEE Transactions on Communications, vol. 68, no. 9, pp. 5326-5337, Sept. 2020.