Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.
Low-density parity-check codes
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Turán numbers yield the bound b ≥ aγ − a(√(24a−23)−1)/4 on (a,b)-ETS in 8-girth variable-regular LDPC codes when no two 8-cycles share a variable node, and chord removal eliminates small ETS.
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.
-
Tur\'{a}n-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
Turán numbers yield the bound b ≥ aγ − a(√(24a−23)−1)/4 on (a,b)-ETS in 8-girth variable-regular LDPC codes when no two 8-cycles share a variable node, and chord removal eliminates small ETS.