Better Bounds on the Minimum Lee Distance
SIAM Journal on Discrete Mathematics · 30.06.2026 · 40 (2) · 836-864
DOI: 10.1137/23m159192x ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 02.06.2026. Verfasst von Jessica Bariffi und 1 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Gefördert von: Bundesministerium für Bildung und Forschung, H2020 Marie Skłodowska-Curie Actions, Technische Universität München.
Abstract (Originalsprache)
This paper provides new and improved bounds on the minimum distance for Lee-metric codes over finite integer residue rings. The bounds are derived through generalized weights, rather than a puncturing argument. In this regard, we generalize the notion of support to the Lee metric, define the Lee-metric column support, and consider the minimum Lee distances of the filtration subcodes. Finally, we compare the newly derived bounds with existing bounds and discuss the density of the respective optimal codes.
Förderung
- Bundesministerium für Bildung und Forschung
- H2020 Marie Skłodowska-Curie Actions
- Technische Universität München
Zitieren
APA
Bariffi, J., & Weger, V. (2026). Better Bounds on the Minimum Lee Distance. SIAM Journal on Discrete Mathematics, 40(2), 836-864. https://doi.org/10.1137/23m159192x
Vancouver
Bariffi J, Weger V. Better Bounds on the Minimum Lee Distance. SIAM Journal on Discrete Mathematics. 2026;40(2):836-864. doi:10.1137/23m159192x
BibTeX
@article{Bariffi2026,
author = {Bariffi, Jessica and Weger, Violetta},
title = {Better Bounds on the Minimum Lee Distance},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {2},
pages = {836--864},
doi = {10.1137/23m159192x}
}
EUVIMED