Girth analysis of quantum quasi-cyclic LDPC codes

DOI10.1134/S0032946024020017MaRDI QIDQ6633979zbMATH OpenFDO

Authors Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi

Publication date 6 November 2024

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946024020017

zbMATH Keywords

girthquantum QC-LDPC codesTanner graph

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Linear codes (general theory) (94B05)

Cites work

• A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth
• Good error-correcting codes based on very sparse matrices
• Good quantum error-correcting codes exist
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• On the hardness of the minimum distance problem of quantum codes
• Quantum LDPC Codes With Almost Linear Minimum Distance
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Simple quantum error-correcting codes

This page was built for publication: Girth analysis of quantum quasi-cyclic LDPC codes

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