Plotkin-optimal pure quantum LRCs with large minimum distances from NMDS codes

@misc{li2026plotkinoptimal,
  title = {{Plotkin-optimal pure quantum LRCs with large minimum distances from NMDS codes}},
  author = {Yang Li and Shitao Li and Gaojun Luo and San Ling},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.05335},
  eprint = {2611.05335},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.05335},
}

TY  - UNPB
TI  - Plotkin-optimal pure quantum LRCs with large minimum distances from NMDS codes
AU  - Yang Li
AU  - Shitao Li
AU  - Gaojun Luo
AU  - San Ling
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.05335
UR  - https://arxiv.org/abs/2611.05335
AB  - Quantum locally recoverable codes (qLRCs) are a class of quantum error-correcting codes that can recover an erased qudit by accessing only a few other qudits. This paper develops a general framework for constructing optimal pure qLRCs that attain the Plotkin-like bound, referred to as Plotkin-optimal pure qLRCs, from Hermitian dual-containing near maximum-distance separable (NMDS) codes. Focusing on a special class of NMDS codes called extended subcodes of generalized Reed-Solomon (ESGRS) codes, we determine their localities by analyzing certain subset sum problems over finite fields. By further exploiting the algebraic structures of ESGRS codes and related codes, we construct four families of Plotkin-optimal pure qLRCs with large lengths and more flexible minimum distances than existing constructions. These constructions provide strong global error-correction capability while retaining local recovery. To the best of our knowledge, they give the first families of qLRCs attaining the pure Plotkin-like bound. In addition, by using the resulting locality property, we resolve in the negative a related problem on ESGRS codes supporting combinatorial designs.
ER  -