title: On the linear programming bound for linear Lee codes.
abstract: Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.
authors.affiliation: Department of Signal Processing, Tampere University of Technology, 33101 Tampere, Finland.
authors.forename: Helena
authors.initials: H
authors.lastname: Astola
authors.affiliation: Department of Signal Processing, Tampere University of Technology, 33101 Tampere, Finland.
authors.forename: Ioan
authors.initials: I
authors.lastname: Tabus
keywords: Lee codes; Lee-compositions; Lee-numbers; Linear codes; Linear programming bound