On some punctured codes of ℤq-Simplex codes

In this paper, we have constructed some new codes from [Formula: see text]-Simplex code called unit [Formula: see text]-Simplex code. In particular, we find the parameters of these codes and have proved that it is a [Formula: see text] [Formula: see text]-linear code, where [Formula: see text] and [Formula: see text] is a smallest prime divisor of [Formula: see text]. When rank [Formula: see text] and [Formula: see text] is a prime power, we have given the weight distribution of unit [Formula: see text]-Simplex code. For the rank [Formula: see text] we obtain the partial weight distribution of unit [Formula: see text]-Simplex code when [Formula: see text] is a prime power. Further, we derive the weight distribution of unit [Formula: see text]-Simplex code for the rank [Formula: see text] [Formula: see text].

On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance

In this paper, we give lower and upper bounds on the covering radius of codes over the ring [Formula: see text] where [Formula: see text] with respect to Chinese Euclidean distance and also obtain the covering radius of various Repetition codes, Simplex codes of [Formula: see text]-Type code and [Formula: see text]-Type code. We give bounds on the covering radius for MacDonald codes of both types over [Formula: see text]