跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22221 · v1

Subsystem Stabilizer $(r,δ)$-Locally Recoverable Codes: Characterization, Bounds and Constructions

首次提交 2026-11-17 13:04
版本更新 2026-11-17 13:04
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

Local erasure recovery limits the number of physical systems accessed to repair a distributed quantum memory. For subsystem stabilizer codes (SSCs), a basic question is whether erasures can be corrected within a prescribed repair set. In this paper, we study subsystem stabilizer (r,δ)(r,δ)-locally recoverable codes ((r,δ)(r,δ)-SSLRCs), in which each coordinate belongs to a repair set of size between δδ and r+δ−1r+δ-1 that corrects any set of up to δ−1δ-1 erasures while preserving the logical subsystem and allowing the gauge subsystem to change. We first characterize local erasure recovery algebraically and apply this criterion to Calderbank-Shor-Steane (CSS) and Hermitian hull constructions for (r,δ)(r,δ)-SSLRCs. For (r,δ)(r,δ)-SSLRCs, without assuming purity, we derive a redundancy bound for disjoint repair sets, a supported-subspace bound based on supported stabilizer and gauge subspaces, and a mixed counting bound for known erasures within selected repair sets and errors at unknown positions outside their union. For pure (r,δ)(r,δ)-SSLRCs with overlapping repair sets, we establish the Singleton-type and alphabet-dependent bounds, together with explicit Griesmer, Hamming, and Plotkin bounds. Moreover, we construct nine classes of $\F_q$-linear pure (r,δ)(r,δ)-SSLRCs from maximum distance separable (MDS) stabilizer codes, Reed-Solomon (RS) codes, and linear codes with MDS Hermitian hulls, which are simultaneously optimal with respect to several bounds for (r,δ)(r,δ)-SSLRCs.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 13:04 · 最新观测版本

Subsystem Stabilizer $(r,δ)$-Locally Recoverable Codes: Characterization, Bounds and Constructions

Local erasure recovery limits the number of physical systems accessed to repair a distributed quantum memory. For subsystem stabilizer codes (SSCs), a basic question is whether erasures can be corrected within a prescribed repair set. In this paper, we study subsystem stabilizer (r,δ)(r,δ)-locally recoverable codes ((r,δ)(r,δ)-SSLRCs), in which each coordinate belongs to a repair set of size between δδ and r+δ−1r+δ-1 that corrects any set of up to δ−1δ-1 erasures while preserving the logical subsystem and allowing the gauge subsystem to change. We first characterize local erasure recovery algebraically and apply this criterion to Calderbank-Shor-Steane (CSS) and Hermitian hull constructions for (r,δ)(r,δ)-SSLRCs. For (r,δ)(r,δ)-SSLRCs, without assuming purity, we derive a redundancy bound for disjoint repair sets, a supported-subspace bound based on supported stabilizer and gauge subspaces, and a mixed counting bound for known erasures within selected repair sets and errors at unknown positions outside their union. For pure (r,δ)(r,δ)-SSLRCs with overlapping repair sets, we establish the Singleton-type and alphabet-dependent bounds, together with explicit Griesmer, Hamming, and Plotkin bounds. Moreover, we construct nine classes of $\F_q$-linear pure (r,δ)(r,δ)-SSLRCs from maximum distance separable (MDS) stabilizer codes, Reed-Solomon (RS) codes, and linear codes with MDS Hermitian hulls, which are simultaneously optimal with respect to several bounds for (r,δ)(r,δ)-SSLRCs.

查看此版本解读 →查看此版本原文 ↗