DocumentCode
106346
Title
Sharpening the linear programming bound for linear Lee codes
Author
Astola, H. ; Tabus, I.
Author_Institution
Dept. of Signal Process., Tampere Univ. of Technol., Tampere, Finland
Volume
51
Issue
6
fYear
2015
fDate
3 19 2015
Firstpage
492
Lastpage
494
Abstract
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. A sharpening to the linear programming bound for linear codes in the Lee metric is introduced, which is based on an invariance-type property of Lee compositions of a linear code. Using this property, additional equality constraints are introduced into the linear programming problem, which give a tighter bound for linear Lee codes.
Keywords
linear codes; linear programming; Lee composition invariance-type property; coding theory; linear Lee codes; linear programming;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el.2014.4300
Filename
7062148
Link To Document