On the asymptotic behaviour of Lee-codes

Abstract The asymptotic forms of bounds on the information rate of Lee-codes are derived and their relative strength is discussed. Also it is shown that the covering radius of Lee-codes lies asymptotically on the Varshamov-Gilbert bound.

[1]  Jack K. Wolf,et al.  On Channels and Codes for the Lee Metric , 1971, Inf. Control..

[2]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[3]  Jaakko Astola.  An Elias-type bound for Lee codes over large alphabets and its application to perfect codes , 1982, IEEE Trans. Inf. Theory.

[4]  Gérard D. Cohen,et al.  A nonconstructive upper bound on covering radius , 1983, IEEE Trans. Inf. Theory.

[5]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .