Peer-reviewedLicence not statedIEEE Transactions on Information Theory
Optimal Quantum ( r , δ )-Locally Repairable Codes From Matrix-Product Codes
- 1Beijing Institute of Mathematical Sciences and Applications, Beijing, China
Related
- Optimal Pure Quantum ( r , δ )-Locally Recoverable Codes From Matrix-Product Construction
- Good Quantum Locally Testable Codes from Product Expansion
- Quantum Matrix-Product Codes: CSS-T Characterization and Maximality
- Optimal quantum locally differentially private mechanisms in the high-privacy regime
- Localized charges, reset noise, and boundary memory in matrix-product-conserving quantum chains
BibTeX
@article{cao2026optimal,
title = {{Optimal Quantum ( r , δ )-Locally Repairable Codes From Matrix-Product Codes}},
author = {Meng Cao and Kun Zhou},
journal = {IEEE Transactions on Information Theory},
year = {2026},
month = may,
doi = {10.1109/tit.2026.3691784},
url = {http://arxiv.org/abs/2508.03597},
}
RIS
TY - JOUR
TI - Optimal Quantum ( r , δ )-Locally Repairable Codes From Matrix-Product Codes
AU - Meng Cao
AU - Kun Zhou
PY - 2026
DA - 2026/05/14
JO - IEEE Transactions on Information Theory
DO - 10.1109/tit.2026.3691784
UR - http://arxiv.org/abs/2508.03597
SN - 0018-9448
SN - 1557-9654
ER -