| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420209 | Discrete Applied Mathematics | 2006 | 12 Pages |
Abstract
The paper considers exact values of and upper bounds on the maximal cardinality AqL(n,d) of a q-ary Lee code of length n with a minimum distance ⩾d⩾d. Special attention is paid to small parameters. Some new results are presented and tables with the presently known best upper bounds are given for q∈{5,6,7}q∈{5,6,7} and n⩽7n⩽7.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jörn Quistorff,