In this paper we investigate known Singleton-like bounds in the Lee metric and characterize their extremal codes, which turn out to be very few. We then focus on Plotkin-like bounds in the Lee metric and present a new bound that extends and refines a previously known, and out-performs it in the case of non-free codes. We then compute the density of extremal codes with regard to the new bound. Finally we fill a gap in the characterization of Lee-equidistant codes.
Keywords:
Ring-linear codeLee distanceMaximum Lee distanceBoundsConstant weight codes
Dewey Decimal Classification:
510 Mathematik
Horizon 2020:
This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 899987.