On the linear programming bound for linear Lee codes

Helena Astola; Ioan Tabus

doi:10.1186/s40064-016-1863-8

On the linear programming bound for linear Lee codes

Helena Astola^*
, Ioan Tabus

^*Corresponding author for this work

Research output: Contribution to journal › Article › Scientific › peer-review

2 Citations (Scopus)

87 Downloads (Pure)

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.

Original language	English
Article number	246
Pages (from-to)	1-13
Number of pages	13
Journal	SpringerPlus
Volume	5
Issue number	1
DOIs	https://doi.org/10.1186/s40064-016-1863-8
Publication status	Published - 1 Mar 2016
Publication type	A1 Journal article-refereed

Keywords

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

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

General

Access to Document

10.1186/s40064-016-1863-8

On the linear programming bound for linear Lee codes
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Final published version, 1.28 MBLicence: CC BY

http://urn.fi/URN:NBN:fi:tty-201604123798

Cite this

@article{aff6bc42ad724113a6991d8dfb01cc1e,

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 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.",

keywords = "Lee codes, Lee-compositions, Lee-numbers, Linear codes, Linear programming bound",

author = "Helena Astola and Ioan Tabus",

year = "2016",

month = mar,

day = "1",

doi = "10.1186/s40064-016-1863-8",

language = "English",

volume = "5",

pages = "1--13",

journal = "SpringerPlus",

issn = "2193-1801",

publisher = "Springer-Verlag",

number = "1",

}

TY - JOUR

T1 - On the linear programming bound for linear Lee codes

AU - Astola, Helena

AU - Tabus, Ioan

PY - 2016/3/1

Y1 - 2016/3/1

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

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

KW - Lee codes

KW - Lee-compositions

KW - Lee-numbers

KW - Linear codes

KW - Linear programming bound

U2 - 10.1186/s40064-016-1863-8

DO - 10.1186/s40064-016-1863-8

M3 - Article

AN - SCOPUS:84959296573

SN - 2193-1801

VL - 5

SP - 1

EP - 13

JO - SpringerPlus

JF - SpringerPlus

IS - 1

M1 - 246

ER -

On the linear programming bound for linear Lee codes

Abstract

Keywords

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this