Los puntos clave no están disponibles para este artículo en este momento.
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 Formula: see text which have applications in error detection and error correction.
Gupta et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: