← 研踪 PaperTrailarXiv: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
摘要
We extend the auxiliary-field method for scattered subspaces to evasive subspaces and subspace designs. For and coprime with , we construct spanning -evasive -subspaces of of dimension in every sufficiently large admissible ambient dimension, with a threshold independent of . When , 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 and every sufficiently large , minimal rank-metric codes of optimal length with first two generalized weights and . For these codes the stable profile is equivalent to minimality with the largest possible minimum distance; for even the analogous class consists of minimal MRD codes. More generally, for and , we obtain nondegenerate -minimal codes of length for every sufficiently large , uniformly in . We also construct maximum -designs whose number of members grows exponentially with the ambient dimension at fixed , and the associated maximum sum-rank distance (MSRD) codes with a growing number of equal long blocks. In extension degree five, the ordinary and -minimal constructions hold for every and every and , respectively.
作者备注:33 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 and coprime with , we construct spanning -evasive -subspaces of of dimension in every sufficiently large admissible ambient dimension, with a threshold independent of . When , 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 and every sufficiently large , minimal rank-metric codes of optimal length with first two generalized weights and . For these codes the stable profile is equivalent to minimality with the largest possible minimum distance; for even the analogous class consists of minimal MRD codes. More generally, for and , we obtain nondegenerate -minimal codes of length for every sufficiently large , uniformly in . We also construct maximum -designs whose number of members grows exponentially with the ambient dimension at fixed , and the associated maximum sum-rank distance (MSRD) codes with a growing number of equal long blocks. In extension degree five, the ordinary and -minimal constructions hold for every and every and , respectively.
查看此版本解读 →查看此版本原文 ↗