arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.09457math.COcs.ITmath.IT
收藏

阻塞集、极小码与三相异码

Blocking sets, minimal codes and trifferent codes

Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi

AI总结:

本文建立仿射阻塞集、强阻塞集、极小码与线性三相异码之间的等价关系,据此改进相关上下界,并给出更大的显式线性三相异码构造。

摘要:

我们证明了关于仿射阻塞集最小大小的新上界;仿射阻塞集是指有限仿射空间中与固定余维数的每个仿射子空间都相交的点集。我们表明,关于余维数-2子空间的、由过原点的直线并集生成的仿射阻塞集,与相应射影空间中的强阻塞集等价,而后者又等价于极小码。利用这一等价关系,我们改进了大小至少为3的域上有限射影空间中强阻塞集最小大小的当前最佳上界。此外,利用编码论技术,我们改进了强阻塞集的当前最佳下界。我们研究这些新界的主要动机是它们在三相异码中的应用;三相异码是长度为n的三进制码字集合,其性质是任意三个不同码字之间都存在一个坐标,使它们在该坐标上的值彼此不同。在有限域F_3上,我们证明极小码等价于线性三相异码。利用这一等价关系,我们表明任何长度为n的线性三相异码的大小至多为3^(n/4.55),改进了Pohoata和Zakharov最近给出的上界。此外,我们证明存在长度为n且大小至少为1/3(9/5)^(n/4)的线性三相异码,从而(渐近地)匹配三相异码的最佳下界。我们还给出了关于余维数-2子空间的仿射阻塞集的显式构造,其大小比已知最佳下界大一个常数因子。通过限制到F_3,我们得到大小至少为3^(23n/312)的线性三相异码,改进了当前大小为3^(n/112)的最佳显式构造。

英文摘要:

We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension. We show an equivalence between affine blocking sets with respect to codimension-$2$ subspaces that are generated by taking a union of lines through the origin, and strong blocking sets in the corresponding projective space, which in turn are equivalent to minimal codes. Using this equivalence, we improve the current best upper bounds on the smallest size of a strong blocking set in finite projective spaces over fields of size at least $3$. Furthermore, using coding theoretic techniques, we improve the current best lower bounds on strong blocking set. Our main motivation for these new bounds is their application to trifferent codes, which are sets of ternary codes of length $n$ with the property that for any three distinct codewords there is a coordinate where they all have distinct values. Over the finite field $\mathbb{F}_3$, we prove that minimal codes are equivalent to linear trifferent codes. Using this equivalence, we show that any linear trifferent code of length $n$ has size at most $3^{n/4.55}$, improving the recent upper bound of Pohoata and Zakharov. Moreover, we show the existence of linear trifferent codes of length $n$ and size at least $\frac{1}{3}\left( 9/5 \right)^{n/4}$, thus (asymptotically) matching the best lower bound on trifferent codes. We also give explicit constructions of affine blocking sets with respect to codimension-$2$ subspaces that are a constant factor bigger than the best known lower bound. By restricting to~$\mathbb{F}_3$, we obtain linear trifferent codes of size at least $3^{23n/312}$, improving the current best explicit construction that has size $3^{n/112}$.

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

↑