关于回路码的渐近阶
On the Asymptotic Order of Circuit Codes
摘要:
本文证明了扩展$k$的$d$维电路码的最大长度等于$2^{d+O_k(\log^2d)}$,隐含常数只取决于$k$ .
英文摘要:
In this note we prove that the maximum length of a $d$-dimensional circuit code of spread $k$ equals $2^{d+O_k(\log^2d)}$, with the implied constant depending only on $k$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。