On Maximum Lee Distance Codes
T. L. Alderson, Svenja Huntemann · Journal of Discrete Mathematics · 2013
Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over ℤq are discussed. Two bounds known for linear codes are shown to also hold in the general case, and several new bounds are established. Codes meeting these bounds are investigated and in some cases characterised.