Characterization of some specific lee distance codes over finite rings
Abstract
Codes over integer rings equipped with the Lee metric are gaining attention among researchers recently. In this paper, we investigate some specific linear codes over integer rings and characterize their dimensions and Lee weights using greatest common divisors (GCD). Furthermore, we construct equidistant Lee codes over ℤ2b,ℤ2pandℤp which have applications in error detection and error correction.
Communicated by Suogang Gao