Journal of Discrete Mathematics
Volume 2013 (2013), Article ID 625912, 5 pages
On Maximum Lee Distance Codes
Department of Mathematical Sciences, University of New Brunswick Saint John, Saint John, NB, Canada E2L 4L5
Received 25 September 2012; Accepted 21 November 2012
Academic Editor: Annalisa de Bonis
Copyright © 2013 Tim L. Alderson and Svenja Huntemann. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over 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.