Tampere University of Technology

TUTCRIS Research Portal

On the linear programming bound for linear Lee codes

Research output: Contribution to journalArticleScientificpeer-review

Details

Original languageEnglish
Article number246
Pages (from-to)1-13
Number of pages13
JournalSpringerPlus
Volume5
Issue number1
DOIs
Publication statusPublished - 1 Mar 2016
Publication typeA1 Journal article-refereed

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 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

Keywords

  • Lee codes, Lee-compositions, Lee-numbers, Linear codes, Linear programming bound

Publication forum classification

Field of science, Statistics Finland

Downloads statistics

No data available