Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.
Source code for approximating the mindist problem of LDPC codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.