On ℤq-linear and ℤq-Simplex codes and its related parameters forqis a prime power
P. Chella Pandian, C. Durairajan · Journal of Discrete Mathematical Sciences and Cryptography · 2015
In this paper, we defined the ℤq-linear codes and discussed its various parameters. We constructed ℤq-Simplex code and ℤq-MacDonald code. For q is prime power, we have given that ℤq- Simplex code is an ℤq-linear code, where φ(q) is the Euler φ - function. We have given a lower and an upper bounds of its covering radius for q is a prime power.