关于线性秩度交码存在的研究
On the existence of linear rank-metric intersecting codes
AI总结:
本文研究了秩度交码的参数限制,证明了当k=3且m≥6时,n=2m-3成立,并通过几何方法给出了极值码的特征化。
摘要:
交码是编码理论中的经典对象,其秩度类比最近被引入。尽管定义形式上与汉明度类比相似,但秩度交码的结构和参数约束表现出显著不同的行为。之前证明了非退化[n,k,d]_{q^m/q}秩度交码必须满足2k-1 ≤ n ≤ 2m-3,但上界紧性问题未解决。通过将秩度码几何解释为q-系统,证明了与秩度交码相关的对偶子空间必须满足强排斥性质。这一联系使我们能够推导出此类码的参数新限制,并证明n=2m-3仅在k=3且m≥6时成立。更一般地,我们证明n ≤ 2m - floor((k+4)/2)。此外,我们通过散射F_q子空间的几何特征化这些极值码。作为结果,[2m-3,3,d]_{q^m/q}秩度交码的存在性问题被转化为散射子空间维度为m+3的存在性问题。利用已知的最大散射子空间构造,我们得出当m为偶数时的存在结果。最后,我们证明[6,3,3]_{q^5/q}秩度交码对于任何素数幂q均不存在,从而解决了Bartoli等人在2025年提出的一个开放问题。
英文摘要:
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric intersecting codes exhibit substantially different behavior. It was previously shown that a nondegenerate $[n,k,d]_{q^m/q}$ rank-metric intersecting code must satisfy $2k-1 \le n \le 2m-3$, and the tightness of the upper bound was left open. Using the geometric interpretation of rank-metric codes via $q$-systems, we prove that the dual subspace associated with a rank-metric intersecting code must satisfy strong evasiveness properties. This connection allows us to derive new restrictions on the parameters of such codes and to show that the bound $n=2m-3$ can be attained only when $k=3$ and $m\ge 6$. More generally, we show that $n \leq 2m-\lfloor(k+4)/2\rfloor$. Moreover, we obtain a geometric characterization of these extremal codes in terms of scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$. As a consequence, the existence problem for $[2m-3,3,d]_{q^m/q}$ rank-metric intersecting codes is reduced to the existence of scattered subspaces of dimension $m+3$. Using known constructions of maximum scattered subspaces, we derive existence results when $m$ is even. Finally, we prove that $[6,3,3]_{q^5/q}$ rank-metric intersecting codes do not exist for any prime power $q$, thus resolving an open problem posed by Bartoli et al. in 2025.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。