158 citations · 440 across the 26 of their papers we have counts for
30 papers
Quantum LDPC Codes from Polynomial Minors
Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell
We construct quantum codes from codewords of a cyclic code and the minors of a polynomial matrix. The construction uses a two-row, three-column matrix whose minors yield a second m…
High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices
Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell†
We study two explicit constructions of binary Calderbank--Shor--Steane quantum low-density parity-check (QLDPC) codes with check weight six. The first uses a fixed circulant shift…
Lifted-Product QLDPC Codes in the Polynomial Domain
Vahid Nourozi, Mohsen Moradi, Roxana Smarandache +1
This paper presents a finite-length polynomial-domain formulation of lifted-product quantum low-density parity-check (QLDPC) codes. We formulate the code construction over the quot…
The Number of Cycles of Bi-regular Tanner Graphs in Terms of the Eigenvalues of the Adjacency Matrix
Roxana Smarandache, David G. M. Mitchell
In this paper, we explore new connections between the cycles in the graph of low-density parity-check (LDPC) codes and the eigenvalues of the corresponding adjacency matrix. The re…
Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding
Roxana Smarandache, David G. M. Mitchell, Anthony Gómez-Fonseca
Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are…
A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth
Roxana Smarandache, David G. M. Mitchell
This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the role…