Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes

Published 18 Mar 2026 in cs.IT | (2603.18322v1)

Abstract: We study error-correcting codes in the space Sn,q\mathcal{S}_{n,q} of length-nn multisets over a qq-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 tt-deletion-correcting codes in the regime t<qt<q with redundancy t+O(1)t+O(1), independent of the blocklength nn. Second, we develop a geometric analysis of deletion balls in Sn,q\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 mm, and consequently for the average ball size. We prove that radius-rr deletion balls are minimized at extreme multisets and maximized at the most balanced multisets, giving a formal global characterization of extremal centers in Sn,q\mathcal{S}_{n,q}. We further relate the maximal-ball value to the ideal difference set Sq−1(r,r)S_{q-1}(r,r) through boundary truncation, obtaining explicit closed forms for q=2q=2 and q=3q=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 qq and tt, the resulting average-ball lower bound matches the interior-difference-set scale asymptotically.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.