TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

On the linear programming bound for linear Lee codes

Tutkimustuotosvertaisarvioitu

Yksityiskohdat

AlkuperäiskieliEnglanti
Artikkeli246
Sivut1-13
Sivumäärä13
JulkaisuSpringerPlus
Vuosikerta5
Numero1
DOI - pysyväislinkit
TilaJulkaistu - 1 maaliskuuta 2016
OKM-julkaisutyyppiA1 Alkuperäisartikkeli

Tiivistelmä

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

Tutkimusalat

Julkaisufoorumi-taso

Latausten tilastot

Ei tietoja saatavilla