跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.08627 · v1

Evasive subspaces, minimal rank-metric codes and subspace designs via auxiliary fields

首次提交 2026-11-06 03:17
版本更新 2026-11-06 03:17
雷达观测 2026-11-09 10:16
arXiv ↗PDF ↗

摘要

We extend the auxiliary-field method for scattered subspaces to evasive subspaces and subspace designs. For 1≤h≤k<hn1\le h\le k<hn and coprime h,k+1h,k+1 with n(k−h+1)≥k+1n(k-h+1)\ge k+1, we construct spanning (h,k)(h,k)-evasive Fq\mathbb{F}_q-subspaces of Fqnr\mathbb{F}_{q^n}^r of dimension rn(k−h+1)/(k+1)rn(k-h+1)/(k+1) in every sufficiently large admissible ambient dimension, with a threshold independent of qq. When k<nk<n, this dimension is maximum. The proof combines an intersection lemma, a rank-support density inequality, scalar orbit counting, and a profile preserved by direct sums. The coding consequences include, for every fixed odd extension degree m≥3m\ge3 and every sufficiently large KK, minimal rank-metric codes of optimal length 2K2K with first two generalized weights (m+1)/2(m+1)/2 and m+1m+1. For these codes the stable profile is equivalent to minimality with the largest possible minimum distance; for even mm the analogous class consists of minimal MRD codes. More generally, for 1≤τ≤m−21\leτ\le m-2 and gcd⁡(m,τ+1)=1\gcd(m,τ+1)=1, we obtain nondegenerate ττ-minimal codes of length (τ+1)K(τ+1)K for every sufficiently large KK, uniformly in qq. We also construct maximum hh-designs whose number of members grows exponentially with the ambient dimension at fixed q,n,hq,n,h, and the associated maximum sum-rank distance (MSRD) codes with a growing number of equal long blocks. In extension degree five, the ordinary and 22-minimal constructions hold for every qq and every K≥32K\ge32 and K≥59K\ge59, respectively.

作者备注:33 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 03:17 · 最新观测版本

Evasive subspaces, minimal rank-metric codes and subspace designs via auxiliary fields

We extend the auxiliary-field method for scattered subspaces to evasive subspaces and subspace designs. For 1≤h≤k<hn1\le h\le k<hn and coprime h,k+1h,k+1 with n(k−h+1)≥k+1n(k-h+1)\ge k+1, we construct spanning (h,k)(h,k)-evasive Fq\mathbb{F}_q-subspaces of Fqnr\mathbb{F}_{q^n}^r of dimension rn(k−h+1)/(k+1)rn(k-h+1)/(k+1) in every sufficiently large admissible ambient dimension, with a threshold independent of qq. When k<nk<n, this dimension is maximum. The proof combines an intersection lemma, a rank-support density inequality, scalar orbit counting, and a profile preserved by direct sums. The coding consequences include, for every fixed odd extension degree m≥3m\ge3 and every sufficiently large KK, minimal rank-metric codes of optimal length 2K2K with first two generalized weights (m+1)/2(m+1)/2 and m+1m+1. For these codes the stable profile is equivalent to minimality with the largest possible minimum distance; for even mm the analogous class consists of minimal MRD codes. More generally, for 1≤τ≤m−21\leτ\le m-2 and gcd⁡(m,τ+1)=1\gcd(m,τ+1)=1, we obtain nondegenerate ττ-minimal codes of length (τ+1)K(τ+1)K for every sufficiently large KK, uniformly in qq. We also construct maximum hh-designs whose number of members grows exponentially with the ambient dimension at fixed q,n,hq,n,h, and the associated maximum sum-rank distance (MSRD) codes with a growing number of equal long blocks. In extension degree five, the ordinary and 22-minimal constructions hold for every qq and every K≥32K\ge32 and K≥59K\ge59, respectively.

查看此版本解读 →查看此版本原文 ↗