Abstract
Lower and upper bounds for R(Sk (q)), the covering radius of a k-dimensional q-ary Simplex codes are determined. These help in getting bounds with a gap of one for S 3(q). Exact covering radius of S 2(q), S 3 (3), S 4(3), S 4 (4) and S 3(q) for q even are obtained.
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 callSimilar Papers
Paper Title
Journal
Date
More From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
