Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
