Absorbing sets in quantum LDPC codes

DOI10.3934/AMC.2026023MaRDI QIDQ7239379zbMATH OpenFDO

Authors Kirsten D. Morris, Tefjol Pllaha, Christine A. Kelley

Publication date 8 May 2026

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2026023

zbMATH Keywords

absorbing setsiterative decodingquantum LDPC codestrapping sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cites work

• A recursive approach to low complexity codes
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Good quantum error-correcting codes exist
• Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
• Simple quantum error-correcting codes
• Sparse-Graph Codes for Quantum Error Correction

This page was built for publication: Absorbing sets in quantum LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239379)