The Number of Cycles of Biregular Tanner Graphs in Terms of the Eigenvalues of the Adjacency Matrix
Abstract
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 resulting observations are used to derive fast, simple, recursive formulas for the number of cycles $N_{2k}$ of length $2k$, $k
Fields of Study & Subjects
Error Correcting Code Techniques
Graph theory and applications
Coding theory and cryptography
Publication details
- Journal / source
- IEEE Transactions on Information Theory
- Pages
- 1–1
- Publication date
- 1 January 2026