On almost perfect linear Lee codes of packing radius 2

Abstract: More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes

C

of packing radius

r

in

m a t h b b Z^{n}

for

r g e q 2

and

n g e q 3

. Recently, Leung and the second author proved that if

C

is linear, then the Golomb-Welch conjecture is valid for

r = 2

and

n g e q 3

. In this paper, we consider the classification of linear Lee codes with the second-best possibility, that is the density of the lattice packing of

m a t h b b Z^{n}

by Lee spheres

S (n, r)

equals

f r a c | S (n, r) | | S (n, r) | + 1

. We show that, for

r = 2

and

n e q u i v 0, 3, 4 p m o d 6

, this packing density can never be achieved.

This page was built for publication: On almost perfect linear Lee codes of packing radius 2