Girth analysis of quantum quasi-cyclic LDPC codes
From MaRDI portal
Publication:6633979
DOI10.1134/S0032946024020017MaRDI QIDQ6633979
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Publication date: 6 November 2024
Published in: Problems of Information Transmission (Search for Journal in Brave)
Linear codes (general theory) (94B05) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Good error-correcting codes based on very sparse matrices
- Quantum LDPC Codes With Almost Linear Minimum Distance
- A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth
- On the hardness of the minimum distance problem of quantum codes
- Good quantum error-correcting codes exist
- 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)
