固定冗余度的模拟纠错码单错误纠错阈值的最优指数
Optimal Exponent of the Single-Error Correction Threshold with Fixed Redundancy for Analog Error-Correcting Codes
浏览论文内容
中文总结 AI 辅助
针对固定冗余度的实线性码模拟纠错码单错误纠错阈值的下界问题，本文证明了匹配已有上界的最优指数下界，完成了该阈值的渐近刻画。
中文摘要 AI 辅助
Roth提出的模拟纠错码（Analog ECCs）用于解决内存计算中向量-矩阵乘法因模拟噪声和稀疏异常值产生的错误。一个基本的开放问题是关于固定冗余度r=n-k≥2的实[n,k]线性码的单错误纠错阈值Γ₂(𝒞)的下界。Li等人最近证明了当冗余度r=2时，每个实[n,n-2]线性码𝒞满足Γ₂(𝒞)≥csc²(π/(2n))，解决了Roth研究中的一个开放问题，并指出对于每个固定的r≥2，存在一类实数域上的[n,k]线性码𝒞使得Γ₂(𝒞)≤O(n^(1+1/(r-1)))。本文证明了Li等人结果的匹配逆命题：对于每个固定冗余度2≤r<n的线性码𝒞⊆ℝⁿ，有Γ₂(𝒞)≥(a_r/(√r β_{r-1} 2^(1/(r-1))))·n^(1+1/(r-1))，其中a_r=Γ(r/2)/(√π Γ((r+1)/2))，β_d=(dπ^(d-1)|𝕊ᵈ|/|𝕊ᵈ⁻¹|)^(1/d)（d为正整数），𝕊ᵈ表示ℝᵈ⁺¹中的单位球面，|𝕊ᵈ|为其表面积，Γ(·)为Gamma函数。特别地，本文进一步证明Γ₂(𝒞)≥(1/(4π√3 r))·n^(1+1/(r-1))。结合Li等人的上界，本文确认指数n^(1+1/(r-1))是最优的，完成了模拟纠错码单错误纠错阈值的渐近刻画。
英文摘要
Analog error-correcting codes (Analog ECCs), introduced by Roth [1], address errors in vector-matrix multiplication arising from analog noise and sparse outliers in in-memory computing. A fundamental open problem concerns the lower bound on the single-error correction threshold $Γ_2(\mathcal C)$ for real $[n,k]$ linear codes with fixed redundancy $r=n-k\geq 2$. Li et al. [2] recently established that for redundancy $r=2$, every real $[n,n-2]$ linear code $\mathcal{C}$ satisfies $Γ_2(\mathcal C)\geq \csc^2(\fracπ{2n})$, resolving an open problem in [1], and showed that, for every fixed $r \geq 2$, there exists a class of $[n,k]$ linear code $\mathcal{C}$ over $\mathbb{R}$ such that $Γ_2(\mathcal{C}) \leq O(n^{1+\frac{1}{r-1}})$. This paper proves the matching converse in [2]. For every $[n,k]$ linear code $\mathcal{C}\subseteq \mathbb R^n$ with fixed redundancy $2\leq r<n$, we show that \[ Γ_2(\mathcal C)\ge \frac{a_r}{\sqrt{r}\,β_{r-1}\,2^{\frac{1}{r-1}}}\cdot n^{1+\frac{1}{r-1}}, \] where $a_r =\frac{Γ(\frac{r}{2})}{\sqrtπ\,Γ(\frac{r+1}{2})}$ and $β_d = \left(\frac{dπ^{d-1}|\mathbb S^d|}{|\mathbb S^{d-1}|}\right)^{\frac{1}{d}}$ for positive integer $d$. Here $\mathbb S^d$ denotes the unit sphere in $\mathbb R^{d+1}$, $|\mathbb S^d|$ its surface area, and $Γ(\cdot)$ the Gamma function. In particular, we further show that $Γ_2(\mathcal C)\geq \frac{1}{4π\sqrt{3}r}\cdot n^{1+\frac{1}{r-1}}$. Together with the upper bound in [2], this confirms that the exponent $n^{1+\frac{1}{r-1}}$ is optimal, completing the asymptotic characterization of the single-error correction threshold for Analog ECCs.
