🤖 AI Summary
This paper addresses the multi-deletion correction problem over non-binary alphabets by proposing a novel class of overlap-free (i.e., symbol-distinct) error-correcting codes and an efficient decoding algorithm. Methodologically, it pioneers the integration of set codes and permutation codes to construct explicit, high-rate, non-binary overlap-free codes with strong t-deletion correction capability; combinatorial design and algebraic decoding techniques enable polynomial-time complete decoding. Key contributions are: (1) the first theoretical guarantee unifying explicit construction, high rate, and t-deletion correction capacity; (2) improved code-length lower bounds surpassing all prior constructions within critical parameter regimes, achieving current optimality; and (3) a new coding paradigm for non-binary multi-deletion channels that bridges theoretical rigor and practical applicability.
📝 Abstract
Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new explicit construction of such codes, based on set and permutation codes. We show that our multiplicity-free codes can correct multiple deletions and provide a decoding algorithm. We also show that, for a certain regime of parameters, our constructed codes have size larger than all the previously known non-binary codes correcting multiple deletions.