多项式构造与删除球几何学用于多重集删除码
Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes
AI总结:
本文研究了在删除度量下长度为n的多重集空间S_{n,q}中的纠错码,提出了多项式Sidon型构造和删除球几何分析,得出了多重集t-删除纠正码的构造方法和删除球大小的精确公式。
摘要:
我们研究了在删除度量下长度为n的多重集空间S_{n,q}中的纠错码,受排列信道中顺序完全丢失且错误仅作用于符号乘数的动机。我们开发了两个互补方向。首先,我们提出了有限域上的多项式Sidon型构造,以项目性和仿射形式呈现,得到在t<q范围内具有冗余度t+O(1)的多重集t-删除纠正码,与块长n无关。其次,我们开发了删除球在S_{n,q}中的几何分析。利用差向量表示与相关生成函数的对角简化,我们推导出单个删除球大小的精确生成函数表达式,固定距离m的多重集有序对数量的精确公式,以及由此得出的平均球大小。我们证明半径为r的删除球在极端多重集时最小,在最平衡的多重集时最大,从而给出了S_{n,q}中极值中心的正式全局特征。我们进一步通过边界截断将最大球值与理想差集S_{q-1}(r,r)相关联,得到q=2和q=3的显式闭合形式。这些几何结果导致基于体积的码大小界,包括球面封存上界,受边界意识分析的码-反码论证,以及由精确平均球大小控制的Gilbert-Varshamov型下界。对于固定的q和t,所得的平均球下界在渐近上与内部差集尺度匹配。
英文摘要:
We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is completely lost and errors act only on symbol multiplicities. We develop two complementary directions. First, we present polynomial Sidon-type constructions over finite fields, in both projective and affine forms, yielding multiset $t$-deletion-correcting codes in the regime $t<q$ with redundancy $t+O(1)$, independent of the blocklength $n$. Second, we develop a geometric analysis of deletion balls in $\mathcal{S}_{n,q}$. Using difference-vector representations together with a diagonal reduction of the relevant generating functions, we derive exact generating-function expressions for individual deletion-ball sizes, exact formulas for the number of ordered pairs of multisets at a fixed distance $m$, and consequently for the average ball size. We prove that radius-$r$ deletion balls are minimized at extreme multisets and maximized at the most balanced multisets, giving a formal global characterization of extremal centers in $\mathcal{S}_{n,q}$. We further relate the maximal-ball value to the ideal difference set $S_{q-1}(r,r)$ through boundary truncation, obtaining explicit closed forms for $q=2$ and $q=3$. These geometric results lead to volume-based bounds on code size, including sphere-packing upper bounds, a boundary-aware analysis of code--anticode arguments, and Gilbert--Varshamov-type lower bounds governed by exact average ball sizes. For fixed $q$ and $t$, the resulting average-ball lower bound matches the interior-difference-set scale asymptotically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。