Technology
Constructions of Quantum $(r,\delta)$-LRCs from cyclic codes
Key Points
Announce Type: new Abstract: Classical $(r,\delta)$ locally recoverable codes (LRCs) play a central role in distributed data storage systems as they enable an efficient recovery from erasures by accessing a small number of surviving symbols. Motivated by their prospective use in future quantum data storage and by recent theoretical progress on quantum locally recoverable codes (qLRCs), we investigate the construction of qLRCs from classical cyclic $(r,\delta)$-LRCs. Our approach identifies...
arXiv:2606.09522v1 Announce Type: new
Abstract: Classical $(r,\delta)$ locally recoverable codes (LRCs) play a central role in distributed data storage systems as they enable an efficient recovery from erasures by accessing a small number of surviving symbols. Motivated by their prospective use in future quantum data storage and by recent theoretical progress on quantum locally recoverable codes (qLRCs), we investigate the construction of qLRCs from classical cyclic $(r,\delta)$-LRCs. Our approach identifies cyclic LRCs whose defining sets satisfy a dual-containing condition, allowing them to serve as valid CSS ingredients. We present three explicit families of $(r,\delta)$-qLRCs, two of which are optimal with respect to the quantum Singleton-like bound, whenever the codes are pure, thereby providing optimal examples. Additionally, the codes presented in Constructions 2 and 3 have no bound on their lengths with respect to the field size required to obtain these codes.