关于编码优质码且线数为线性的电路的最小深度
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
AI总结:
本研究改进了已有构造与分析,证明编码优质纠错码的电路线数上界,得到线性规模电路的最小深度范围,还提出超集中器诱导码并揭示其与超集中器图的双向紧密联系。
摘要:
设$S_d(n)$表示深度为$d$(扇入无界)的电路编码距离至少为$4n$的纠错码$C:\{0, 1\}^n \to \{0, 1\}^{32n}$所需的最少线数。Gál、Hansen、Koucký、Pudlák和Viola[IEEE Trans. Inform. Theory 59(10), 2013]证明,对任意固定的$d \ge 3$,有$S_d(n) = Θ_d(λ_d(n)\cdot n)$。通过改进他们的构造与分析,我们证明$S_d(n)= O(λ_d(n)\cdot n)$。令$d = α(n)$(逆阿克曼函数的一种形式),我们得到了线性规模的电路。该深度$α(n)$在相差一个加法常数2的范围内是最小可能值;我们将近乎匹配的深度下界归功于Gál等人,因为该下界可直接由他们的方法推导得出(尽管该工作中未明确提出或完全验证),且是通过明确Pudlák的一个图论引理[Combinatorica, 14(2), 1994]中的若干常数,并将其推广到超常数深度得到的。\n我们还研究了MDS码的一个子类$C: \mathbb{F}^n \to \mathbb{F}^m$,其特征是对任意不同的$x, y \in \mathbb{F}^n$,满足汉明距离关系$\mathrm{dist}(C(x), C(y)) \ge m - \mathrm{dist}(x, y) + 1$。(对于线性码,这等价于生成矩阵是完全可逆的。)我们将这类码称为超集中器诱导码(superconcentrator-induced codes),并证明了它们与超集中器的紧密联系。具体而言,我们发现任意编码超集中器诱导码的线性或非线性电路都必然是超集中器图,且任意超集中器图都可以在足够大的域(域大小关于图的规模呈指数)上转化为编码超集中器诱导码的线性电路。
英文摘要:
Let $S_d(n)$ denote the minimum number of wires of a depth-$d$ (unbounded fan-in) circuit encoding an error-correcting code $C:\{0, 1\}^n \to \{0, 1\}^{32n}$ with distance at least $4n$. Gál, Hansen, Koucký, Pudlák, and Viola [IEEE Trans. Inform. Theory 59(10), 2013] proved that $S_d(n) = Θ_d(λ_d(n)\cdot n)$ for any fixed $d \ge 3$. By improving their construction and analysis, we prove $S_d(n)= O(λ_d(n)\cdot n)$. Letting $d = α(n)$, a version of the inverse Ackermann function, we obtain circuits of linear size. This depth $α(n)$ is the minimum possible to within an additive constant 2; we credit the nearly-matching depth lower bound to Gál et al., since it directly follows their method (although not explicitly claimed or fully verified in that work), and is obtained by making some constants explicit in a graph-theoretic lemma of Pudlák [Combinatorica, 14(2), 1994], extending it to super-constant depths. We also study a subclass of MDS codes $C: \mathbb{F}^n \to \mathbb{F}^m$ characterized by the Hamming-distance relation $\mathrm{dist}(C(x), C(y)) \ge m - \mathrm{dist}(x, y) + 1$ for any distinct $x, y \in \mathbb{F}^n$. (For linear codes this is equivalent to the generator matrix being totally invertible.) We call these superconcentrator-induced codes, and we show their tight connection with superconcentrators. Specifically, we observe that any linear or nonlinear circuit encoding a superconcentrator-induced code must be a superconcentrator graph, and any superconcentrator graph can be converted to a linear circuit, over a sufficiently large field (exponential in the size of the graph), encoding a superconcentrator-induced code.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。