arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.16082cs.CC
收藏

具有小字母表和小查询大小的良好局部可测试码

Good Locally Testable Codes with Small Alphabet and Small Query Size

University of Haifa(海法大学)

Uriya First, Stav Lazarovici

AI总结:

研究良好局部可测试码存在的限制,通过建立降低字母表大小的通用方法,证明对于多种情况存在相应良好的\(q\)查询LTC,解决了特定条件下良好\(q\)查询LTC的存在性问题。

摘要:

本 - 萨松、戈德赖希和苏丹表明,允许二查询测试器的二进制纠错码不可能是良好的,即它不能同时具有线性距离和恒定速率。他们还表明,如果字母表是有限域\(\mathbb{F}\),码是\(\mathbb{F}\)-线性的,且二查询测试器是\(\mathbb{F}\)-线性的,就不存在良好的码。我们证明这些基本上是良好局部可测试码(LTC)存在的唯一限制。即对于任何字母表大小大于2的情况都有良好的二查询LTC,二进制字母表有良好的三查询LTC等。这完全解决了对于每个\(q\geq2\)和字母表(或\(\mathbb{F}\)-向量空间)\(\Sigma\),是否存在具有字母表\(\Sigma\)的良好\(q\)查询LTC(或\(\mathbb{F}\)-LTC)的问题。我们的证明基于第一作者和考夫曼最近的良好二查询\(\mathbb{F}\)-LTC,通过建立一种降低良好低查询LTC字母表大小的通用方法。

英文摘要:

Ben-Sasson, Goldreich and Sudan showed that a binary error correcting code admitting a $2$-query tester cannot be good, i.e., it cannot have both linear distance and constant rate. They also showed that there are no good codes if the alphabet is a finite field $\mathbb{F}$, the code is $\mathbb{F}$-linear, and the $2$-query tester is $\mathbb{F}$-linear. We show that those are essentially the only limitations on the existence of good locally testable codes (LTCs). That is, there are good $2$-query LTCs on any alphabet with more than $2$ letters, and good $3$-query LTCs with a binary alphabet. Similarly, there are good $3$-query $\mathbb{F}$-linear LTCs, and for every $\mathbb{F}$-vector space $V$ of dimension greater than $1$, there are good $2$-query LTCs with alphabet $V$ whose tester is $\mathbb{F}$-linear. This completely solves, for every $q\geq 2$ and alphabet (resp. $\mathbb{F}$-vector space) $Σ$, the question of whether there is a good $q$-query LTC (resp. $\mathbb{F}$-LTC) with alphabet $Σ$. Our proof builds on the recent good $2$-query $\mathbb{F}$-LTCs of the first author and Kaufman, by establishing a general method for reducing the alphabet size of a good low-query LTC.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑