Title :
Bounds on the size of Lee-codes
Author :
Astola, Heikki ; Tabus, Ioan
Author_Institution :
Dept. of Signal Process., Tampere Univ. of Technol., Tampere, Finland
Abstract :
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds. The obtained bounds are useful in determining whether good codes suitable for signal processing applications exist with given parameters.
Keywords :
codes; Lee codes; Lee metric; Lee numbers; coding theory; linear programming method; recursive formula; Encoding; Linear programming; Measurement; Signal processing; Upper bound; Vectors; Zinc;
Conference_Titel :
Image and Signal Processing and Analysis (ISPA), 2013 8th International Symposium on
Conference_Location :
Trieste
DOI :
10.1109/ISPA.2013.6703787