Frontend
Subsystem Stabilizer $(r,\delta)$-Locally Recoverable Codes: Characterization, Bounds and Constructions
arXiv math.IT0 views
arXiv:2611.22221v1 Announce Type: new Abstract: 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,\delta)$-locally recoverable codes ($(r,\delta)$-SSLRCs), in which each coordinate belongs to a repair set of size between $\delta$ and $r+\delta-1$ that corrects any set of up to $\delta-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,\delta)$-SSLRCs. For $(r,\delta)$-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,\delta)$-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,\delta)$-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,\delta)$-SSLRCs.
Source:https://arxiv.org/abs/2611.22221PreviousComputed Permutation Trellis Coding: Near-Optimal Quantization from Two Multiplications and a 64-Byte TableNextNoise Characterization and Robust Signal Detection in Yeast Pheromone Molecular Communication
Related posts
HotSymbol: A Simple Way to Find, Copy, and Use Thousands of Symbols Online
0dev.to
No Webfonts, No Frameworks: The Performance Budget I Keep on My Tool Pages
0dev.to
How the Turkish ID number (TCKN) checksum works, with validators in JavaScript, Python and PHP
0dev.to
Our homepage demo has four numbers for one score, and an ordinal suffix with three branches that can never run
0dev.to
![[Phân tích kỹ thuật] Anthropic ra mắt Code Mode cho Claude Code: Bước ngoặt xâu chuỗi Tool Call bằng JavaScript](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fuurfrhh192toa94intza.webp)
[Phân tích kỹ thuật] Anthropic ra mắt Code Mode cho Claude Code: Bước ngoặt xâu chuỗi Tool Call bằng JavaScript
0dev.to
How I built phone continuity for my desktop AI companion: 2-minute pairing codes, a 4-file browser, and 0 native-app installs
0dev.to