On the linear programming bound for linear Lee codes
Research output: Contribution to journal › Article › Scientific › peer-review
|Number of pages||13|
|Publication status||Published - 1 Mar 2016|
|Publication type||A1 Journal article-refereed|
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 presented.) 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.
ASJC Scopus subject areas
- Lee codes, Lee-compositions, Lee-numbers, Linear codes, Linear programming bound