跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.11219 · v1

A Characterization of $q$-Ary $2$-Designs and a $3$-Design Obstruction for Doubly-Extended Reed-Solomon Codes

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

摘要

Let Ck\mathcal{C}_k be the doubly extended Reed--Solomon code with parameters [q+1,k,q−k+2]q[q+1,k,q-k+2]_q, where q≥3q\ge3 is a prime power and 2≤k≤q2\le k\le q. We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of Ck\mathcal{C}_k do not form a qq-ary 33-design when 2≤k≤q−12\le k\le q-1. Using shortening, we extend this obstruction to every nonempty weight class with 3≤w<q+13\le w<q+1. We also establish that each individual nonempty positive-weight class of Ck\mathcal{C}_k forms a qq-ary 22-design if and only if gcd⁡(k−1,q−1)=1\gcd(k-1,q-1)=1. Consequently, every nonempty positive-weight class below full support has exact qq-ary design strength 22 when this coprimality condition holds, and 11 otherwise.The three-design obstruction follows by applying a classical subset-product character identity to a marginal covering count for three prescribed nonzero symbols. The comparison between weights rests on a covering-count formulation of the classical MDS coset-weight relations. For every linear [n,k,d]q[n,k,d]_q MDS code with 2≤k≤n−12\le k\le n-1, this formulation shows that the qq-ary 22-design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for 2≤t≤min⁡{k,d}2\le t\le\min\{k,d\}, we prove that the qq-ary tt-design property at any t−1t-1 distinct nonempty positive weights forces it at all nonempty positive weights.

作者备注:18 pages

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-08 16:09 · 最新观测版本

A Characterization of $q$-Ary $2$-Designs and a $3$-Design Obstruction for Doubly-Extended Reed-Solomon Codes

Let Ck\mathcal{C}_k be the doubly extended Reed--Solomon code with parameters [q+1,k,q−k+2]q[q+1,k,q-k+2]_q, where q≥3q\ge3 is a prime power and 2≤k≤q2\le k\le q. We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of Ck\mathcal{C}_k do not form a qq-ary 33-design when 2≤k≤q−12\le k\le q-1. Using shortening, we extend this obstruction to every nonempty weight class with 3≤w<q+13\le w<q+1. We also establish that each individual nonempty positive-weight class of Ck\mathcal{C}_k forms a qq-ary 22-design if and only if gcd⁡(k−1,q−1)=1\gcd(k-1,q-1)=1. Consequently, every nonempty positive-weight class below full support has exact qq-ary design strength 22 when this coprimality condition holds, and 11 otherwise.The three-design obstruction follows by applying a classical subset-product character identity to a marginal covering count for three prescribed nonzero symbols. The comparison between weights rests on a covering-count formulation of the classical MDS coset-weight relations. For every linear [n,k,d]q[n,k,d]_q MDS code with 2≤k≤n−12\le k\le n-1, this formulation shows that the qq-ary 22-design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for 2≤t≤min⁡{k,d}2\le t\le\min\{k,d\}, we prove that the qq-ary tt-design property at any t−1t-1 distinct nonempty positive weights forces it at all nonempty positive weights.

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