betaFeedback

WorksComputer Science

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

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,δ)(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.

Introduction

Quantum error-correcting codes protect quantum information against noise and the loss of physical systems [24, 34]. An erasure is the loss of a physical system at a known location. In a distributed quantum memory, recovery may require access to surviving systems at different locations. Local erasure recovery limits the number of systems accessed by confining recovery to a prescribed repair set [16]. Under (r,δ)(r,\delta)-locality, every coordinate belongs to a repair set of size between δ\delta and r+δ−1r+\delta-1, within which any set of up to δ−1\delta-1 erasures can be corrected [13]. In contrast, the global minimum distance dd guarantees correction of any set of up to d−1d-1 erasures when recovery can access all surviving systems. Thus, δ\delta specifies a local erasure tolerance under an access restriction, whereas dd describes protection without this restriction. For codes with a nontrivial logical subsystem, (r,δ)(r,\delta)-locality implies d≥δd \geq\delta (see Corollary III.10).

Subsystem stabilizer codes (SSCs) decompose the encoded space into a logical subsystem and a gauge subsystem [24, 34]. Recovery preserves the logical subsystem and its correlations with any reference system, while a completely positive trace-preserving (CPTP) map acts on the gauge subsystem. Pauli errors differing by a gauge operator are equivalent for logical recovery. We construct a syndrome decoder that distinguishes these equivalence classes using stabilizers supported in the repair set. Stabilizer and subsystem codes identify errors modulo SS and GG, respectively; the additional freedom is described by the quotient space G/SG/S.

In this paper, we study subsystem stabilizer (r,δ)(r,\delta)-locally recoverable codes ((r,δ)(r,\delta)-SSLRCs) and determine how local recovery requirements constrain the logical dimension, gauge dimension, and global minimum distance. More precisely, we address the following three questions:

  1. Algebraic characterization: what conditions on the stabilizer and gauge label spaces characterize erasure recovery within a prescribed repair set for arbitrary joint states of the logical and gauge subsystems?

  1. Parameter bounds: what bounds follow from (r,δ)(r,\delta)-locality without a purity assumption, and what further bounds hold for pure codes?

  1. Optimal pure constructions: can explicit pure (r,δ)(r,\delta)-SSLRCs simultaneously attain the resulting bounds?

Yaozong Zhang is with the School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, China (e-mail: [email protected]).

Sihem Mesnager is with the Department of Mathematics, University of Paris VIII, 93526 Saint-Denis, France, with the Laboratory Analysis, Geometry and Applications, LAGA, CNRS, UMR7539, 93430 Villetaneuse, France, and also with the Telecom Paris, Polytechnic Institute of Paris, 91120 Palaiseau, France (e-mail: [email protected]).

Xiaoqiang Wang is with the Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan 430062, China (e-mail: [email protected]).

Jian Gao is with the School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China (e-mail: [email protected]).

Corresponding author: Jian Gao.

Classical locally recoverable codes (cLRCs). In classical coding theory, Gopalan et al. [17] introduced the notion of symbol locality. A symbol has locality at most rr if it can be recovered from at most rr other symbols. They established the Singleton-type bound d≤n−k−⌈k/r⌉+2d \le n-k-\lceil k/r\rceil+2 for an [n,k,d]q[n,k,d]_q linear code whose information symbols have locality at most rr. Prakash et al. [35] introduced (r,δ)(r,\delta)-locality to allow local correction of multiple erasures and obtained the bound d≤n−k+1−(⌈k/r⌉−1)(δ−1)d \le n-k+1-(\lceil k/r\rceil-1)(\delta-1), which reduces to the previous bound when δ=2\delta=2. Cadambe and Mazumdar [7] derived alphabet-dependent bounds, while Grezet et al. [19] obtained such bounds for linear codes with (r,δ)(r,\delta)-locality by using residual codes. By accounting for the alphabet size, these bounds can improve on Singleton-type bounds over small alphabets.

Quantum locally recoverable codes (qLRCs). Golowich and Guruswami [16] studied quantum local recovery from single erasures. Luo et al. [31] derived parameter bounds and constructed pure qLRCs attaining them through the CSS construction. Galindo et al. [13] characterized (r,δ)(r,\delta)-locality for stabilizer codes in terms of puncturing and shortening. For stabilizer codes obtained from Euclidean or Hermitian dual-containing classical codes, their Singleton-type bound involves the classical minimum distance, which can be replaced by the quantum minimum distance under purity [13 Theorem 31 and Remark 34]. Galindo et al. [12] subsequently constructed impure qLRCs exceeding the corresponding bounds of pure qLRCs. For Hermitian constructions, Li et al. [27] established further bounds and constructions for pure qLRCs, while Li et al. [26] derived bounds for pure and impure qLRCs and used tt-designs to determine their locality. Matsumoto [33] characterized stabilizer measurements sufficient for erasure correction and determined the minimum number of measurements within the corresponding decoding model. Entanglement-assisted qLRCs were studied in [14, 28]. In these models, local recovery may also access the receiver’s halves of preshared maximally entangled pairs; these halves are assumed to be unaffected by erasures. The (r,δ)(r,\delta)-SSLRCs considered in this paper use no entanglement assistance; recovery preserves the logical subsystem and allows the gauge subsystem to change.

Quantum bounds for qLRCs. Kumar and Bandi [25] obtained explicit Griesmer, Hamming, and Plotkin bounds for pure qLRCs from the Hermitian construction. Ball, Lavrauw, and Popatia [4] established a Griesmer-type bound for additive codes without requiring linearity over the extension field. Since the associated classical codes need not be linear over Fq2\mathbb{F}_{q^2}, we use this additive bound. Stylianou and Boche [37] used blockwise weight enumerators to derive bounds for qLRCs with disjoint repair sets under a blockwise purity condition. Their formulation does not require a stabilizer structure.

SSCs and gauge freedom. Operator quantum error correction [24] and the subsystem stabilizer formalism [34] allow recovery to preserve logical information while changing the gauge subsystem. Aly and Klappenecker [1] developed additive constructions and propagation rules for trading logical and gauge dimensions with guarantees on minimum distance and purity. Further constructions arise from Hermitian hulls [29, 30], while Bacon-Shor codes [3] provide impure examples with weight-two gauge generators. Quantum code concatenation [23], including concatenation of subsystem codes [9 Lemma 20], provides bounds on the minimum distance in terms of the constituent-code distances. The geometric locality in [9] concerns interaction lengths, whereas the locality studied here concerns erasure recovery within prescribed coordinate sets. Bé​​ny et al. [6] studied approximate recovery under locality and symmetry constraints. Cao, Cotardo, and Lackey [8] studied supported symplectic subspaces and local invariants of stabilizer and subsystem codes through quantum anticodes.

Global and local constraints. Klappenecker and Sarvepalli [22] proved a Singleton bound for Fq\mathbb{F}_q-linear subsystem codes without a purity assumption. This bound constrains the global code parameters without incorporating a prescribed family of repair sets. For (r,δ)(r,\delta)-SSLRCs, a further question is which errors can be distinguished modulo the gauge space using only stabilizers supported in a repair set. We give an algebraic characterization of this requirement and use it to derive parameter bounds.

Recovery Model and Methods

We require local recovery to return the state to the original code space and preserve the logical subsystem together with its correlations with an arbitrary reference system. We impose this requirement on every joint state of the logical, gauge, and reference systems. The gauge state may change and need not be known.

Let GG and SS denote the gauge and stabilizer label spaces, respectively. For a coordinate set TT, let WTW_T be the space of Pauli labels supported in TT, and let LT=L∩WTL_T=L\cap W_T. Theorem III.8 shows that a nonempty erased set E⊆ΓE\subseteq\Gamma is recoverable within Γ\Gamma if and only if WE∩S⊥t=GEW_E\cap S^{\perp_t}=G_E, where ⊥t\perp_t denotes trace-symplectic orthogonality. To prove sufficiency, we construct an explicit local recovery channel based on stabilizer syndrome measurements. Without assuming purity, we derive bounds by studying supported stabilizer and gauge subspaces and counting gauge-equivalence classes of errors. For pure codes with a nontrivial logical subsystem, the stabilizer eigenspace defines a stabilizer code with the same minimum distance [2 Lemma 10]. We show that this reduction preserves the prescribed repair cover and obtain further bounds by shortening an associated additive classical code.

Main Contributions

In this paper, the parameters of an (r,δ)(r,\delta)-SSC Q\mathcal{Q} are denoted by ((n,K,R,d))q((n,K,R,d))_q, where KK and RR are the logical and gauge dimensions, and dd is the global minimum distance. When K=qkK=q^k and R=qgR=q^g for nonnegative integers kk and gg, we say that QQ is an (r,δ)(r,\delta)-SSC with parameters [[n,k,g,d]]q[[n,k,g,d]]_q. The notation dim⁡p\dim_p denotes dimension over Fp\mathbb{F}_p. Our main results for (r,δ)(r,\delta)-SSLRCs are summarized as follows. Item 1) answers (Q1), items 2) and 3) answer (Q2), and item 4) answers (Q3).

  1. Algebraic characterization. For an (r,δ)(r,\delta)-SSC, we establish necessary and sufficient algebraic conditions for local erasure recovery within a prescribed repair set without a purity assumption (see Theorem III.8). We construct a recovery channel for arbitrary joint logical-gauge states, including correlations with a reference system. We establish algebraic criteria for the CSS and Hermitian hull constructions of QQ (see Propositions III.12 and III.15). If R=1R=1, the criterion reduces to the stabilizer local recovery condition in [13].

  1. Bounds without a purity assumption. We derive a redundancy bound for (r,δ)(r,\delta)-SSLRCs with disjoint repair sets (Proposition IV.1). When two disjoint erased sets of an (r,δ)(r,\delta)-SSLRC are globally correctable, their supported gauge spaces and the stabilizers on the remaining coordinates bound KK and RR (see Theorem IV.3). The mixed counting bound in Theorem IV.7 constrains KRKR for fewer than δ\delta known erasures in each of several pairwise disjoint repair sets and at most tt errors at unknown positions outside their union, where 2t<d2t<d.

  1. Bounds for pure codes. We establish a rank-accumulation lemma for additive (r,δ)(r,\delta)-cLRCs based on the arguments in [7 Lemma 1] and [19 proof of Corollary 2] (see Lemma V.3). Using this result to shorten the comparison codes, we derive Singleton-type and alphabet-dependent bounds for pure (r,δ)(r,\delta)-SSLRCs (see Theorems V.4 and V.7). Moreover, by applying the corresponding classical bounds to these shortened codes, we obtain explicit Griesmer, Hamming, and Plotkin bounds (see Theorems V.10 and V.12).

  1. Optimal constructions of pure codes. We determine the parameters of tensor products of SSCs and trade logical and gauge dimensions while preserving the stabilizer label space, minimum distance, and repair cover (see Propositions VI.1 and VI.2). We apply these results to construct nine classes of pure (r,δ)(r,\delta)-SSLRCs from MDS stabilizer codes, Reed-Solomon codes, and MDS Hermitian hulls (see Table I). These pure codes simultaneously attain the Singleton-type bound (42), the alphabet-dependent bound (44), the Fq2\mathbb{F}_{q^2}-linear Griesmer bound (50), and the redundancy bound (33).

Parameters(r,δ)(r,\delta)ConditionsReferences
[[BN,B(N−2d0+2)−g,g,d0]]q\left[\left[B N,B(N-2d_0+2)-g,g,d_0\right]\right]_q(N−d0+1,d0)(N-d_0+1,d_0)3≤N≤q3\le N\le q, 2≤d0≤⌊(N+1)/2⌋2\le d_0\le\lfloor(N+1)/2\rfloor, 0≤g≤B(N−2d0+2)−10\le g\le B(N-2d_0+2)-1Cor. VI.8(i)
[[B(ν+1)q,B(ν+1)(q−2)−g,g,ν+2]]q\left[\left[B(\nu+1)q,B(\nu+1)(q-2)-g,g,\nu+2\right]\right]_q((ν+1)(q−1),ν+2)((\nu+1)(q-1),\nu+2)q≥3q\ge3, 0≤ν≤q−20\le\nu\le q-2, 0≤g≤B(ν+1)(q−2)−10\le g\le B(\nu+1)(q-2)-1Cor. VI.8(ii)
[[B(q−1),B(q−2s−1)−g,g,s+1]]q\left[\left[B(q-1),B(q-2s-1)-g,g,s+1\right]\right]_q(q−s−1,s+1)(q-s-1,s+1)1≤s<(q−1)/21\le s<(q-1)/2, 0≤g≤B(q−2s−1)−10\le g\le B(q-2s-1)-1Cor. VI.8(iii)
[[Bq,B(q−2s−2)−g,g,s+2]]q\left[\left[Bq,B(q-2s-2)-g,g,s+2\right]\right]_q(q−s−1,s+2)(q-s-1,s+2)0≤s≤⌊(q−3)/2⌋0\le s\le\lfloor(q-3)/2\rfloor, 0≤g≤B(q−2s−2)−10\le g\le B(q-2s-2)-1Cor. VI.8(iv)
[[B(q2−1),B(q2−2s−1)−g,g,s+1]]q\left[\left[B(q^2-1),B(q^2-2s-1)-g,g,s+1\right]\right]_q(q2−s−1,s+1)(q^2-s-1,s+1)1≤s<q−11\le s<q-1, 0≤g≤B(q2−2s−1)−10\le g\le B(q^2-2s-1)-1Cor. VI.8(v)
[[Bq2,B(q2−2s−2)−g,g,s+2]]q\left[\left[Bq^2,B(q^2-2s-2)-g,g,s+2\right]\right]_q(q2−s−1,s+2)(q^2-s-1,s+2)0≤s<q−10\le s<q-1, 0≤g≤B(q2−2s−2)−10\le g\le B(q^2-2s-2)-1Cor. VI.8(vi)
[[Bq,B(q−2t)−g,g,t+1]]q\left[\left[Bq,B(q-2t)-g,g,t+1\right]\right]_q(q−t,t+1)(q-t,t+1)1≤t<q/21\le t<q/2, 0≤g≤B(q−2t)−10\le g\le B(q-2t)-1Thm. VI.6
[[BN,B(N−2hH)−g,g,hH+1]]q\left[\left[B N,B(N-2h_H)-g,g,h_H+1\right]\right]_q(N−hH,hH+1)(N-h_H,h_H+1)1≤hH<c1\le h_H<c, c+hH<N≤q−1c+h_H<N\le q-1, 0≤g≤B(N−2hH)−10\le g\le B(N-2h_H)-1Thm. VI.11
[[Bq2,B(q2−2q+2)−g,g,q]]q\left[\left[Bq^2,B(q^2-2q+2)-g,g,q\right]\right]_q(q2−q+1,q)(q^2-q+1,q)0≤g≤B(q2−2q+2)−10\le g\le B(q^2-2q+2)-1Prop. VI.12

Table I. Optimal pure Fq\mathbb{F}_q-linear (r,δ)(r,\delta)-SSLRCS attaining the bounds (41), (43), (49) and (32).

References

  1. [1]S. A. Aly and A. Klappenecker, “Subsystem code constructions,” in Proc. IEEE Int. Symp. Inf. Theory, pp. 369–373, 2008.arxiv.org/abs/0712.4321
  2. [2]S. A. Aly, A. Klappenecker, and P. K. Sarvepalli, “Subsystem codes,” in Proc. 44th Annu. Allerton Conf. Commun., Control, Comput., pp. 528–535, 2006.arxiv.org/abs/quant-ph/0610153
  3. [3]D. Bacon, “Operator quantum error-correcting memories,” Phys. Rev. A, vol. 73, Art. no. 012340, 2006.DOI
  4. [4]S. Ball, M. Lavrauw, and T. Potapov, “Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes,” Des. Codes Cryptogr., vol. 93, no. 1, pp. 175–196, 2025.
  5. [5]D. Bartoli, A. Giannoni, G. Marino, and Y. Zhou, “Long QMDS additive code,” arXiv:2509.03186, 2025.arxiv.org/abs/2509.03186
  6. [6]C. Bé​​ny, Z. Zimborás, and F. Pastawski, “Approximate recovery with locality and symmetry constraints,” arXiv:1806.10324v2, 2019.arxiv.org/abs/1806.10324
  7. [7]V. R. C. Dazmabe and A. Mazumdar, “Bounds on the size of locally recoverable codes,” IEEE Trans. Inf. Theory, vol. 61, no. 11, pp. 5787–5794, 2015.DOI
  8. [8]C. Cao, G. Cotardo, and B. Lackey, “Quantum anticodes,” arXiv:2512.13891, 2025.arxiv.org/abs/2512.13891
  9. [9]S. Dai, R. Li, and E. Tang, “Optimal locality and parameter tradeoffs for subsystem codes,” in Proc. 20th Conf. Theory Quantum Comput., Commun. Cryptogr., LIPIcs, vol. 350, pp. 4:1–4:22, 2025.arxiv.org/abs/2503.22651
  10. [10]P. Delsarte, “An algebraic approach to the association schemes of coding theory,” Philips Res. Rep. Suppl., no. 10, pp. 1–97, 1973.
  11. [11]G. D. Forney, Jr., and H. Gluesing-Luerssen, “Codes on graphs: Observability, controllability, and local reducibility,” IEEE Trans. Inf. Theory, vol. 59, no. 1, pp. 223–237, Jan. 2013.arxiv.org/abs/1203.3115
  12. [12]C. Galindo, F. Hernando, H. Martín-Cruz, and R. Matsumoto, “Impure codes exceeding the pure bounds for quantum local recovery,” Quantum Inf. Process., vol. 25, Art. no. 241, 2026.DOI
  13. [13]C. Galindo, F. Hernando, H. Martín-Cruz, and R. Matsumoto, “Quantum (r, δ)-locally recoverable codes,” Finite Fields Appl., vol. 111, Art. no. 102785, Mar. 2026.DOI
  14. [14]C. Galindo, F. Hernando, H. Martín-Cruz, and R. Matsumoto, “Entanglement assisted quantum (r, δ)-locally recoverable codes,” arXiv:2608.17118, 2026.arxiv.org/abs/2608.17118
  15. [15]C. Galindo, F. Hernando, R. Matsumoto, and D. Ruano, “Entanglement-assisted quantum error-correcting codes over arbitrary finite fields,” Quantum Inf. Process., vol. 18, Art. no. 116, 2019.
  16. [16]L. Golowich and W. Guruswami, “Quantum locally recoverable codes,” in Proc. Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), 2025, pp. 5512–5522.
  17. [17]P. Gopalan, C. Huang, H. Šmitic, and S. Yekhanin, “On the locality of codeword symbols,” IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925–6934, 2012.arxiv.org/abs/1106.3625
  18. [18]M. Grassl, T. Beth, and M. Rötteler, “On optimal quantum codes,” Int. J. Quantum Inf., vol. 2, no. 1, pp. 55–64, 2004.DOI
  19. [19]M. Grezet, R. Freij-Hollanti, T. Westerbäck, and C. Hollanti, “Alphabet-dependent bounds for linear locally repairable codes based on residual codes,” IEEE Trans. Inf. Theory, vol. 65, no. 10, pp. 6089–6100, 2019.DOI
  20. [20]W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge, U.K.: Cambridge University Press, 2003.
  21. [21]A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields,” IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 4892–4914, Nov. 2006.
  22. [22]A. Klappenecker and P. K. Sarvepalli, “On subsystem codes beating the quantum Hamming or Singleton bound,” Proc. Roy. Soc. A, vol. 463, pp. 2887–2905, 2007.DOI
  23. [23]E. Knill and R. Laflamme, “Concatenated quantum codes,” Los Alamos National Laboratory, Los Alamos, NM, USA, Tech. Rep. LA-UR-96-2808, 1996.DOI
  24. [24]D. W. Kribs, R. Laflamme, D. Poulin, and M. Lesosky, “Operator quantum error correction,” Quantum Inf. Comput., vol. 6, nos. 4–5, pp. 382–399, 2006.
  25. [25]V. Kumar and R. Bandi, “Alphabet-dependent bounds for pure quantum (r, ρ)-locally recoverable codes,” arXiv:2608.28650, 2026.arxiv.org/abs/2608.28650
  26. [26]Y. Li, S. Li, H. Lao, G. Luo, and S. Ling, “On optimal quantum LRCs from the Hermitian construction and t-designs,” IEEE Trans. Inf. Theory, vol. 72, no. 8, pp. 5556–5571, Aug. 2026.arxiv.org/abs/2508.13553
  27. [27]Y. Li, S. Li, G. Luo, and S. Ling, “Improved bounds and optimal constructions of pure quantum locally recoverable codes,” IEEE Trans. Inf. Theory, early access, 2026.arxiv.org/abs/2512.07256
  28. [28]Y. Li, S. Ling, Z. Lu, G. Luo, and S. Zhu, “Entanglement-assisted quantum locally recoverable codes: Characterizations, bounds, and constructions,” arXiv:2607.27091, 2026.arxiv.org/abs/2607.27091
  29. [29]G. Luo, M. F. Ezerman, and S. Ling, “Entanglement-assisted and subsystem quantum codes: New propagation rules and constructions,” arXiv:2206.09782, 2022.arxiv.org/abs/2206.09782
  30. [30]G. Luo, L. Sok, M. F. Ezerman, and S. Ling, “On linear codes whose Hermitian hulls are MDS,” IEEE Trans. Inf. Theory, vol. 70, no. 7, pp. 4889–4904, 2024.DOI
  31. [31]G. Luo, B. Chen, M. F. Ezerman, and S. Ling, “Bounds and constructions of quantum locally recoverable codes from quantum CSS codes,” IEEE Trans. Inf. Theory, vol. 71, no. 3, pp. 1794–1802, 2025.arxiv.org/abs/2312.11115
  32. [32]F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, ser. North-Holland Mathematical Library, vol. 16. Amsterdam, The Netherlands: North-Holland, 1977.
  33. [33]R. Matsumoto, “Reducing measurements in quantum erasure correction by quantum local recovery,” Comput. Appl. Math., vol. 46, Art. no. 15, 2027.DOI
  34. [34]D. Poulin, “Stabilizer formalism for operator quantum error correction,” Phys. Rev. Lett., vol. 95, Art. no. 230504, 2005.DOI
  35. [35]N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, “Optimal linear codes with a local-error-correction property,” in Proc. IEEE Int. Symp. Inf. Theory, pp. 2776–2780, 2012.arxiv.org/abs/1202.2414
  36. [36]P. K. Sarvepalli and A. Klappenecker, “Nonbinary quantum Reed–Muller codes,” in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, pp. 1023–1027, 2005.DOI
  37. [37]E. Stylianou and H. Boche, “Bounds for pure disjoint (r, δ)-quantum locally recoverable codes,” in Proc. IEEE Int. Symp. Inf. Theory, pp. 1–6, 2026.arxiv.org/abs/2608.10922
  38. [38]J. Watrous, The Theory of Quantum Information. Cambridge University Press, 2018.DOI

Paper details

vlnc:W_2e9gc85x
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents