Bounds on the size of Lee-codes

Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds. The obtained bounds are useful in determining whether good codes suitable for signal processing applications exist with given parameters.