Affiliation:
1. Department of Mathematics, Bharathidasan University, Tiruchirappalli-620 024, Tamil Nadu, India
Abstract
In this paper, we gives lower and upper bounds on the covering radius of codes over [Formula: see text], where [Formula: see text] is a prime integer with respect to Lee distance. We also determine the covering radius of various Repetition codes over [Formula: see text], where [Formula: see text] is a prime integer.
Funder
Department of Science and Technology, Ministry of Science and Technology
Council of Scientific and Industrial Research
Publisher
World Scientific Pub Co Pte Lt
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献