296 citations · 584 across the 31 of their papers we have counts for
34 papers
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…
High-Rate Spatially Coupled LDPC Codes Based on Massey's Convolutional Self-Orthogonal Codes
Daniel J. Costello, Min Zhu, David G. M. Mitchell +1
In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-…
Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes
Salman Habib, David G. M. Mitchell
In this work, we propose reinforcement learning (RL) for sequential decoding of moderate length generalized low-density parity-check (GLDPC) codes. Here, sequential decoding refers…
Iterative Threshold Decoding of Spatially Coupled, Parallel-Concatenated Codes
Andrew D. Cummins, David G. M. Mitchell, Daniel J. Costello
Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constr…
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…
Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs
Anthony Gómez-Fonseca, Roxana Smarandache, David G. M. Mitchell
This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth…