Finite Multiset Codes and Affine Lattice Restrictions
Version 1 / Oct 20, 2026 / CC BY 4.0
Abstract
We study constant-weight nonnegative integer vectors under half-L1 distance and compare arbitrary codes with full intersections of affine additive-subgroup cosets with the discrete simplex. A heavy-coordinate decomposition gives the exact reduction A_q(n,n-s) = q + B_q(n,s) to codes whose coordinates are bounded by s. It determines the unrestricted optimum throughout 2n > (q+1)s. For every q ≥ 3 and s ≥ 2, at n = qs−1 and D = (q−1)s−1 the unrestricted and full-coset optima are respectively q+1 and q; we classify all q² unrestricted extremizers. We retain a complete classification of both optima for three coordinates and n < 2D. In the next ternary band, 2D ≤ n < 3D, eight words are attainable precisely when 3n ≥ 8D; equality yields an infinite eight-versus-seven full-coset separation. Exact finite certificates also give a six-versus-five gap at (q,n,D) = (4,5,3) and the quinary single-deletion values A_5(9,2) = 143 and A_5(10,2) = 201. The proofs use intersection bounds and explicit integer affine combinations. The unrestricted decomposition extends known methods, and bibliographic novelty remains unresolved, particularly against a closely related 2024 paper not compared in full.
Provenance statement
Tools used
- OpenAI
- OpenAI-powered assistant (Lyra).
References
- M. Kovačević and V. Y. F. Tan, ``Codes in the Space of Multisets---Coding for Permutation Channels with Impairments,'' IEEE Transactions on Information Theory 64(7), 5156--5169 (2018). doi:10.1109/TIT.2017.2789292 (https://doi.org/10.1109/TIT.2017.2789292). https://arxiv.org/abs/1612.08837.DOI
- A. Kreindel, I. B. Essayag, and A. L. Zabokritskiy (Yohananov), ``Multiset Deletion Codes: Cyclic Constructions, Bounds, and Exact Results,'' arXiv:2601.05636v2 (2026; revised 13 July). https://arxiv.org/abs/2601.05636v2.arXiv
- T. Chen, Y. Ma, and X. Zhang, ``Optimal Codes with Small Constant Weight in -Metric,'' arXiv:2003.00483v2 (2020; revised 9 October). https://arxiv.org/abs/2003.00483v2.arXiv
- M. Kovačević and D. Vukobratović, ``Perfect Codes in the Discrete Simplex,'' Designs, Codes and Cryptography 75(1), 81--95 (2015). doi:10.1007/s10623-013-9893-5 (https://doi.org/10.1007/s10623-013-9893-5). https://arxiv.org/abs/1307.3142.DOI
- T. Chen, Z. He, and G. Ge, ``Constant -Weight Codes Under -Metric,'' IEEE Transactions on Information Theory 70(7), 4928--4945 (2024). doi:10.1109/TIT.2024.3385419 (https://doi.org/10.1109/TIT.2024.3385419). Full-text comparison unresolved.DOI
- Z. Lángi, Relative Distance of Points of a Convex Body , doctoral dissertation, ELTE TTK, Mathematics Doctoral School (2003), Chapter 2 and Theorem 6. https://www.math.u-szeged.hu/~zlangi/publications/dissertation.pdf.link
Version history
- v1 · 12 pagesSubmitted by Daniel Adam PyleInitial depositCurrentOct 18, 2026