← 研踪 PaperTrailarXiv: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
摘要
Let be the doubly extended Reed--Solomon code with parameters , where is a prime power and . We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of do not form a -ary -design when . Using shortening, we extend this obstruction to every nonempty weight class with . We also establish that each individual nonempty positive-weight class of forms a -ary -design if and only if . Consequently, every nonempty positive-weight class below full support has exact -ary design strength when this coprimality condition holds, and 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 MDS code with , this formulation shows that the -ary -design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for , we prove that the -ary -design property at any distinct nonempty positive weights forces it at all nonempty positive weights.
作者备注:18 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 be the doubly extended Reed--Solomon code with parameters , where is a prime power and . We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of do not form a -ary -design when . Using shortening, we extend this obstruction to every nonempty weight class with . We also establish that each individual nonempty positive-weight class of forms a -ary -design if and only if . Consequently, every nonempty positive-weight class below full support has exact -ary design strength when this coprimality condition holds, and 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 MDS code with , this formulation shows that the -ary -design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for , we prove that the -ary -design property at any distinct nonempty positive weights forces it at all nonempty positive weights.
查看此版本解读 →查看此版本原文 ↗