Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.
An algorithm for counting short cycles in bipartite graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes
Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.