betaFeedback

WorksComputer Science

The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound

Abstract

In this paper, we study the minimum subpacketization of (n,k)(n,k) Reed-Solomon (RS) codes over Fqℓ\mathbb{F}_{q^\ell} admitting cut-set-optimal exact Fq\mathbb{F}_q-linear repair of every coordinate from any dd helpers. For 3≤k<d≤n−13\le k<d\le n-1, write s=d+1−ks=d+1-k and denote this minimum by ℓmin(n,k,d;q)\ell_{min}(n,k,d;q). Using divisibility and relative-degree constraints on cross-ratio fields of evaluation sets, we establish ℓmin(n,k,d;q)≥sGs(d+1)\ell_{min}(n,k,d;q)\ge sG_s(d+1), where Gs(m)G_s(m) is the minimum product of mm pairwise coprime integers, each at least ss. Let Δs(n,d)Δ_s(n,d) be the minimum of lcm(a1,…,an)lcm(a_1,\ldots,a_n) over positive integers a1,…,ana_1,\ldots,a_n satisfying lcm(aj:j∈J∪{i})≥s lcm(aj:j∈J)lcm(a_j:j\in J\cup\{i\})\ge s~lcm(a_j:j\in J) for every dd-subset J⊆[n]J\subseteq[n] and every i∈[n]∖Ji\in[n]\setminus J. We construct RS codes with subpacketization sΔs(n,d)sΔ_s(n,d) and further prove that ℓmin(n,k,d;q)=sΔs(n,d)=sGs(n)\ell_{min}(n,k,d;q)=sΔ_s(n,d)=sG_s(n) whenever d(d+2)≥4(n+1)d(d+2)\geq 4(n+1), for every prime power qq. In particular, this determines the minimum subpacketization in the full-helper case d=n−1d=n-1, resolving the corresponding exact linear-repair case of Open Problem 20 posed by Ramkumar et al. in their survey on codes for distributed storage. We further give a finite formula for Gs(n)G_s(n) and determine the exact threshold for its closed-form expression in terms of the first nn primes. For fixed kk and dd, we prove log⁡ℓmin(n,k,d;q)=Θk,d(log⁡nlog⁡log⁡n)\log\ell_{min}(n,k,d;q)= Θ_{k,d}(\log n\log\log n) as n→∞n\to\infty, using divisor-function estimates and cover-free families. An affine-plane construction shows that Δs(n,d)<Gs(n)Δ_s(n,d)<G_s(n) for some parameters, so sGs(n)sG_s(n) is not a universal formula. We conjecture that ℓmin(n,k,d;q)=sΔs(n,d)\ell_{min}(n,k,d;q)=sΔ_s(n,d) for every prime power qq and all 3≤k<d≤n−13\le k<d\le n-1.

Introduction

Scalar maximum-distance-separable (MDS) codes are a basic model for storage-optimal erasure protection. An (n,k)(n,k) scalar MDS code over a field KK stores one KK-symbol in each of nn nodes and allows the original kk information symbols to be recovered from any kk nodes. Equivalently, it tolerates any n−kn-k node erasures with the minimum possible redundancy. This global recovery property, however, does not ensure communication-efficient repair of an individual failed node. A direct repair procedure downloads one complete KK-symbol from each of kk surviving nodes and reconstructs the entire codeword, even though only one symbol is missing.

This inefficiency motivates the array-code viewpoint. In an MDS array code over a base field FF, each node stores a vector of ℓ\ell subsymbols, and a helper may transmit functions of its stored vector rather than its entire contents. The regenerating-code framework of Dimakis et al. [1] formalizes the resulting tradeoff between storage and repair communication. If a failed node is repaired from dd helpers and γ\gamma denotes the total number of downloaded FF-symbols, then every MDS array code satisfies the cut-set bound

γ≥dℓd+1−k.(1)\gamma\ge\frac{d\ell}{d+1-k}. \tag*{(1)}

This work was supported in part by the National Key Research and Development Program of China under Grants 2022YFA1004900 and 2022YFA1005000; by the National Natural Science Foundation of China under Grants 62571298, 62571301, and 62371259; by the Fundamental Research Funds for the Central Universities of China (Nankai University); by the Nankai Zhide Foundation; and by the China Postdoctoral Science Foundation under Grant 2025M773088. (Corresponding author: Jing Qiu.)

Weijun Fang is with the State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao 266237, China (e-mail: [email protected]).

Jing Qiu and Shu-Tao Xia are with the Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, Guangdong 518055, China (e-mails: {jing_qiu, xiast}@sz.tsinghua.edu.cn).

Fang-Wei Fu is with the Chern Institute of Mathematics and LPMC, Nankai University, Tianjin 300071, China (e-mail: [email protected]). An MDS array code attaining equality in (1) is a minimum-storage regenerating (MSR) code. Much of the literature on exact-repair MSR codes has focused on MDS array codes; representative constructions include the product-matrix construction [2] and high-rate constructions with optimal repair bandwidth [3]. The node size ℓ\ell, called the subpacketization, determines the granularity available to a repair scheme and is a principal measure of its algebraic and implementation complexity. Fundamental lower bounds on the subpacketization of MSR array codes were developed in [4, 5, 6]. On the construction side, Liu, Li, and Tang constructed high-rate optimal-access MSR codes over small finite fields [7], while Li, Tang, and Tian developed a generic transformation that, when applied iteratively, enables optimal repair of all nodes with controlled subpacketization [8]. Liu, Li, and Tang later extended this line to MDS array codes supporting multiple repair degrees, with smaller subpacketization than earlier multidegree constructions [9]. More recently, Wang, Li, Hu, and Ye constructed MSR codes with d=k+1d=k+1 and subpacketization 2⌈n/3⌉2^{\lceil n/3\rceil} while maintaining a field size linear in nn [10]. With s=d+1−ks=d+1-k, Li, Wang, Hu, and Ye subsequently gave, for every admissible repair degree, optimal-access MSR codes over fields of size Os(n)O_s(n) with subpacketization ℓ=s⌈n/s⌉\ell=s^{\lceil n/s\rceil} and also non-optimal-access MSR codes with the smaller subpacketization s⌈n/(s+1)⌉s^{\lceil n/(s+1)\rceil} [11]. These developments highlight the central role of subpacketization in general MSR array-code design and motivate the corresponding minimum subpacketization problem for the much more rigid class of scalar Reed-Solomon codes.

Reed-Solomon (RS) codes [12] are one of the most important families of scalar MDS codes and are widely used in communication and storage systems. Let F=FqF=\mathbb{F}_q and K=FqℓK=\mathbb{F}_{q^\ell}. Although an RS code is a scalar code over KK, after fixing an FF-basis of KK, each symbol in KK can be represented as a vector in FℓF^\ell. Thus, the same code can be viewed as an MDS array code over FF with subpacketization ℓ\ell. This scalar-to-array viewpoint has also been used more generally in the repair of scalar MDS codes [13].

This viewpoint allows the repair of RS codes to be studied within the regenerating-code framework. However, unlike unrestricted MDS array codes, RS codes are subject to additional algebraic constraints arising from their scalar extension field and polynomial-evaluation structure. Consequently, the repair bandwidth and subpacketization of RS codes have attracted substantial attention. In this paper, we require exact FF-linear repair of every coordinate from every set of dd helper nodes with bandwidth meeting the cut-set bound in (1), and seek the minimum possible extension degree ℓ=[K:F]\ell=[K:F].

Linear Repair of Reed-Solomon Codes

The systematic study of bandwidth-efficient linear repair of scalar RS codes was initiated by Guruswami and Wootters [14]. They established a dual-code characterization of exact FF-linear repair, reducing the design of a repair scheme to the construction of suitable collections of dual codewords, and used trace maps to obtain nontrivial repair schemes for full-length RS codes. Building on this framework, Dau and Milenkovic [15], and later Dau et al. [16], developed optimal repair schemes for additional families of full-length RS codes, including constructions based on subspace polynomials. Here optimality refers to their full-length families and specified redundancy ranges under their linear-repair lower bounds; it need not mean equality in (1). Li, Wang, and Jafarkhani [17] further investigated explicit tradeoffs between repair bandwidth and subpacketization.

A major breakthrough was achieved by Tamo, Ye, and Barg [18], [19], who constructed RS codes attaining the cut-set bound for the repair of any single failed node from any prescribed set of dd helper nodes. With s=d+1−ks=d+1-k, the subpacketization of their construction is

ℓ=s∏i=1np~i\ell=s\prod_{i=1}^{n}\tilde{p}_i

where p~1,…,p~n\tilde{p}_1,\ldots,\tilde{p}_n are distinct primes satisfying p~i≡1(mods)\tilde{p}_i\equiv1\pmod{s}. Their framework also extends to multiple erasures. Subsequent work developed optimal-access and error-resilient repair schemes [20], while near-optimal repair bandwidth with substantially smaller subpacketization was studied in [21].

In our prior work [22], we developed a basis-transformation method for constructing the required repair subspaces for every integer relative extension degree p≥sp\ge s, without the congruence restriction p≡1(mods)p\equiv1\pmod{s}. Applying this method to the Tamo-Ye-Barg framework, we obtained RS codes attaining the cut-set bound using arbitrary distinct prime degrees pi≥sp_i\ge s.

These constructions establish the existence of cut-set-optimal RS repair schemes, but do not determine the least possible subpacketization: assigning distinct prime degrees is only one way to meet the repair requirements. The present paper studies the minimum over all RS evaluation sets, allowing more general degree assignments and deriving lower bounds that apply to every such code.

Main Results

For a prime power qq and integers $3 \le k < d \le n - 1$, let ℓmin⁡(n,k,d;q)\ell_{\min}(n,k,d;q) denote the smallest integer ℓ\ell for which an (n,k)(n,k) RS code over Fqℓ\mathbb{F}_q^\ell admits cut-set-optimal exact Fq\mathbb{F}_q-linear repair of every coordinate from every dd-helper set. Write s=d+1−k≥2s = d + 1 - k \ge2.

Our results are expressed in terms of two arithmetic quantities. For m≥1m \ge1, define

Gs(m)=min⁡{∏i=1mgi:gi∈Z, gi≥s, gcd⁡(gi,gj)=1 for i≠j}.G_s(m) = \min\left\{\prod_{i=1}^{m} g_i : g_i \in\mathbb{Z},\ g_i \ge s,\ \gcd(g_i,g_j) = 1\text{ for }i \ne j\right\}.

with Gs(0)=1G_s(0) = 1. For 1≤t<N1 \le t < N, let Δs(N,t)\Delta_s(N,t) be the minimum of lcm⁡(a1,…,aN)\operatorname{lcm}(a_1,\ldots,a_N) over positive integers a1,…,aNa_1,\ldots,a_N satisfying

lcm⁡(aj:j∈J∪{i})≥slcm⁡(aj:j∈J)(2)\operatorname{lcm}(a_j : j \in J \cup\{i\}) \ge s\operatorname{lcm}(a_j : j \in J) \tag*{(2)}

for every i∈[N]i \in[N] and every tt-subset J⊆[N]∖{i}J \subseteq[N] \setminus\{i\}. The first quantity minimizes a product of pairwise coprime degrees; the second permits shared factors, subject to the relative-degree requirement imposed by every failed-coordinate/helper-set pair. In particular, Δs(n,d)≤Gs(n)\Delta_s(n,d) \le G_s(n).

Our principal result determines the minimum subpacketization exactly. For every prime power qq and all $3 \le k < d \le n - 1$ satisfying d(d+2)≥4(n+1)d(d + 2) \ge4(n + 1), or equivalently d≥4n+5−1d \ge\sqrt{4n + 5} - 1, we prove

ℓmin⁡(n,k,d;q)=sΔs(n,d)=sGs(n).(3)\ell_{\min}(n,k,d;q) = s\Delta_s(n,d) = sG_s(n). \tag*{(3)}

Thus the exact formula applies even when the number of helpers is of order n\sqrt{n}. For full-helper repair (d=n−1d = n - 1), this yields

ℓmin⁡(n,k,n−1;q)=(n−k)Gn−k(n),3≤k<n−1.\ell_{\min}(n,k,n - 1;q) = (n - k)G_{n-k}(n), \qquad3 \le k < n - 1.

This settles the exact Fq\mathbb{F}_q-linear repair case, in the stated dimension range, of Open Problem 20 posed by Ramkumar et al. [23 Open Problem 20].

The main ingredients of the proof and our further contributions are as follows.

  1. Our lower bounds come from the divisibility and relative-degree constraints imposed by cut-set-optimal repair on the fields generated by projective cross-ratios of the evaluation points. Applying these constraints to a punctured (d+1,k)(d + 1,k) RS code in which every coordinate admits cut-set-optimal full-helper repair yields

ℓmin⁡(n,k,d;q)≥sGs(d+1).\ell_{\min}(n,k,d;q) \ge sG_s(d + 1).

which strengthens the lower bound of Tamo, Ye, and Barg [18 Theorem 5] for scalar MDS codes when specialized to RS codes. By using the constraints from all failed-coordinate/helper-set pairs, we first establish ℓmin⁡(n,k,d;q)≥sΔs(n,d)\ell_{\min}(n,k,d;q) \ge s\Delta_s(n,d) for 2d≥n+32d \ge n + 3. To go beyond this range, we combine compositum identities for cross-ratio fields with a finer analysis of the private and shared prime factors of their degrees. Consequently, we establish ℓmin⁡(n,k,d;q)≥sGs(n)\ell_{\min}(n,k,d;q) \ge sG_s(n) whenever d(d+2)≥4(n+1)d(d + 2) \ge4(n + 1).

  1. For the matching upper bound, we extend the distinct-prime constructions to general feasible degree assignments. Our prior work [22 Theorem 3] provides the necessary repair-subspace decomposition for every integer relative degree p≥sp \ge s. We show that every tuple satisfying (2) with (N,t)=(n,d)(N,t) = (n,d) yields an RS code with subpacketization slcm⁡(a1,…,an)s\operatorname{lcm}(a_1,\ldots,a_n) that achieves the cut-set bound for every repair configuration. Unlike the earlier constructions with pairwise distinct prime degrees, these tuples may contain composite degrees with shared prime factors. Minimizing over all feasible tuples, we obtain

ℓmin⁡(n,k,d;q)≤sΔs(n,d)\ell_{\min}(n,k,d;q) \le s\Delta_s(n,d)

for every admissible parameter set and every prime power qq. Together with the lower bounds, this proves (3).

  1. We also study the arithmetic quantity Gs(m)G_s(m) appearing in the exact formula. In addition to a finite formula valid for all mm, we determine the exact threshold for the closed-form expression given below. Let pjp_j denote the jj-th prime, and write pm#=∏j=1mpjp_m^{\#} = \prod_{j=1}^{m} p_j for m≥1m \ge1, with p0#=1p_0^{\#} = 1. Also put As=lcm⁡(1,…,s−1)A_s = \operatorname{lcm}(1,\ldots,s-1). For s≥3s \ge3, let usu_s and vsv_s be the largest prime and the largest prime power, respectively, strictly below ss, and set u2=v2=1u_2 = v_2 = 1. Then

Gs(m)=Aspm#⟺m≥π(usvs),G_s(m) = A_s p_m^{\#} \quad\Longleftrightarrow\quad m \ge\pi(u_s v_s),

where π(x)\pi(x) counts the primes at most xx. In particular, G2(m)=pm#G_2(m) = p_m^{\#} for every mm, giving an explicit expression for (3) when s=2s = 2.

  1. For fixed kk and dd (and any fixed prime power qq), we further prove

log⁡ℓmin⁡(n,k,d;q)=Θk,d(log⁡nlog⁡log⁡n)(n→∞).\log\ell_{\min}(n,k,d;q) = \Theta_{k,d}(\log n \log\log n) \qquad(n \to\infty).

The lower bound has leading coefficient (d−3)/log⁡2(d - 3)/\log2, and the matching-order upper bound follows from cover-free families and our degree construction. By comparison, for fixed ss, the earlier constructions using the smallest admissible distinct prime degrees satisfy log⁡ℓ=Θ(nlog⁡n)\log\ell= \Theta(n \log n).

Finally, the equality ℓmin⁡(n,k,d;q)=sGs(n)\ell_{\min}(n,k,d;q) = sG_s(n) does not hold for all admissible parameters. An affine-plane construction in Appendix B exhibits parameters for which Δs(n,d)<Gs(n)\Delta_s(n,d) < G_s(n) and hence ℓmin⁡(n,k,d;q)<sGs(n)\ell_{\min}(n,k,d;q) < sG_s(n). This distinction suggests that Δs(n,d)\Delta_s(n,d), rather than Gs(n)G_s(n), governs the general problem. We conjecture that

ℓmin⁡(n,k,d;q)=sΔs(n,d)\ell_{\min}(n,k,d;q) = s\Delta_s(n,d)

for every prime power qq and all $3 \le k < d \le n - 1$.

Organization

References

  1. [1]A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539–4551, Sep. 2010.
  2. [2]K. V. Rashmi, N. B. Shah, and P. V. Kumar, “Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction,” IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227–5239, Aug. 2011.DOI
  3. [3]M. Ye and A. Barg, “Explicit constructions of high-rate MDS array codes with optimal repair bandwidth,” IEEE Trans. Inf. Theory, vol. 63, no. 4, pp. 2001–2014, Apr. 2017.arxiv.org/abs/1604.00454
  4. [4]S. Goparaju, I. Tamo, and R. Calderbank, “An improved sub-packetization bound for minimum storage regenerating codes,” IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2770–2779, May 2014.arxiv.org/abs/1305.3498
  5. [5]O. Alrabiah and V. Guruswami, “An exponential lower bound on the sub-packetization of minimum storage regenerating codes,” IEEE Trans. Inf. Theory, vol. 67, no. 12, pp. 8086–8093, Dec. 2021.DOI
  6. [6]S. B. Balaji, M. Vajha, and P. Vijay Kumar, “Lower bounds on the sub-packetization level of MSR codes and characterizing optimal-access MSR codes achieving the bound,” IEEE Trans. Inf. Theory, vol. 68, no. 10, pp. 6452–6471, Oct. 2022.DOI
  7. [7]Y. Liu, J. Li, and X. Tang, “Explicit constructions of high-rate MSR codes with optimal access property over small finite fields,” IEEE Trans. Commun., vol. 66, no. 10, pp. 4405–4413, Oct. 2018.DOI
  8. [8]J. Li, X. Tang, and C. Tian, “A generic transformation to enable optimal repair in MDS codes for distributed storage systems,” IEEE Trans. Inf. Theory, vol. 64, no. 9, pp. 6257–6267, Sep. 2018.DOI
  9. [9]Y. Liu, J. Li, and X. Tang, “A generic transformation to enable optimal repair/access MDS array codes with multiple repair degrees,” IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4407–4428, Jul. 2023.DOI
  10. [10]N. Wang, G. Li, S. Hu, and M. Ye, “Constructing MSR codes with subpacketization 2^{n/3} for k + 1 helper nodes,” IEEE Trans. Inf. Theory, vol. 69, no. 6, pp. 3775–3792, Jun. 2023.
  11. [11]G. Li, N. Wang, S. Hu, and M. Ye, “MSR codes with linear field size and smallest sub-packetization for any number of helper nodes,” IEEE Trans. Inf. Theory, vol. 70, no. 11, pp. 7790–7806, Nov. 2024.
  12. [12]I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” J. Soc. Ind. Appl. Math., vol. 8, no. 2, pp. 300–304, Jun. 1960.DOI
  13. [13]K. Shanmugam, D. S. Papaiōpoulos, A. G. Dimakis, and G. Caire, “A repair framework for scalar MDS codes,” IEEE J. Sel. Areas Commun., vol. 32, no. 5, pp. 998–1007, May 2014.
  14. [14]V. Guruswami and M. Wootters, “Repairing Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5684–5698, Sep. 2017.arxiv.org/abs/1509.04764
  15. [15]H. Dau and O. Milenkovic, “Optimal repair schemes for some families of full-length Reed-Solomon codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017, pp. 346–350.arxiv.org/abs/1701.04120
  16. [16]S. H. Dau, T. X. Dinh, H. M. Kiah, T. T. Luong, and O. Milenkovic, “Repairing Reed-Solomon codes via subspace polynomials,” IEEE Trans. Inf. Theory, vol. 67, no. 10, pp. 6395–6407, Oct. 2021.arxiv.org/abs/2007.15253
  17. [17]W. Li, Z. Wang, and H. Jafar-Khan, “On the sub-packetization size and the repair bandwidth of Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. 65, no. 9, pp. 5484–5502, Sep. 2019.arxiv.org/abs/1806.00496
  18. [18]I. Tamo, M. Ye, and A. Barg, “Optimal repair of Reed-Solomon codes: Achieving the cut-set bound,” in Proc. 58th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), Berkeley, CA, USA, Oct. 2017, pp. 216–227.arxiv.org/abs/1706.00112
  19. [19]I. Tamo, M. Ye, and A. Barg, “The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size,” IEEE Trans. Inf. Theory, vol. 65, no. 5, pp. 2673–2695, May 2019.DOI
  20. [20]Z. Chen, M. Ye, and A. Barg, “Enabling optimal access and error correction for the repair of Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. 66, no. 12, pp. 7439–7456, Dec. 2020.arxiv.org/abs/2001.07189
  21. [21]V. Guruswami and H. Jiang, “Near-optimal repair of Reed-Solomon codes with low subpacketization,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019, pp. 1077–1081.arxiv.org/abs/1907.03931
  22. [22]J. Qiu, W. Fang, S.-T. Xia, and F.-W. Fu, “Reed-Solomon codes with optimal repair bandwidth: A basis-transformation approach,” IEEE Trans. Inf. Theory, early access, 2026, DOI: 10.1109/TIT.2026.3745385.DOI
  23. [23]V. Ramkumar, S. B. Balaji, B. Sasidharan, M. Vajha, M. N. Krishnan, and P. V. Kumar, “Codes for distributed storage,” Found. Trends Commun. Inf. Theory, vol. 19, no. 4, pp. 547–813, 2022.
  24. [24]R. Lidl and H. Niederreiter, Finite Fields, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1997.
  25. [25]G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., revised by D. R. Heath-Brown and J. H. Silverman. Oxford, U.K.: Oxford Univ. Press, 2008.
  26. [26]S. Wigert, “Sur l’ordre de grandeur du nombre des diviseurs d’un entier,” Ark. Mat. Astron. Fys., vol. 3, no. 18, pp. 1–9, 1907.
  27. [27]C. Elsholtz, M. Tech­nau, and N. Tech­nau, “The maximal order of iterated multiplicative functions,” Mathematika, vol. 65, no. 4, pp. 990–1009, 2019.DOI
  28. [28]W. H. Kautz and R. C. Singleton, “Nonrandom binary superimposed codes,” IEEE Trans. Inf. Theory, vol. 10, no. 4, pp. 363–377, Oct. 1964.DOI
  29. [29]E. Porat and A. Rothschild, “Explicit nonadaptive combinatorial group testing schemes,” IEEE Trans. Inf. Theory, vol. 57, no. 12, pp. 7982–7989, Dec. 2011.DOI
  30. [30]J. B. Rosser and L. Schoenfeld, “Approximate formulas for some functions of prime numbers,” Illinois J. Math., vol. 6, no. 1, pp. 64–94, Mar. 1962.

Paper details

vlnc:W_rbzvr65k
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 4

downloads · 0

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

  • Computer Science

OpenAI’s ChatGPT (GPT-6)

View statement
Looking for related papers…
Contents