{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:42:09Z","timestamp":1649036529849},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p> 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] <\/jats:p>","DOI":"10.1142\/s1793830917500173","type":"journal-article","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:08:48Z","timestamp":1484028528000},"page":"1750017","source":"Crossref","is-referenced-by-count":3,"title":["On covering radius of codes over R = \u21242 + u\u21242, where u2 = 0 using chinese euclidean distance"],"prefix":"10.1142","volume":"09","author":[{"given":"P. Chella","family":"Pandian","sequence":"first","affiliation":[{"name":"Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), Tiruchirappalli - 620 005, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"S1793830917500173BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/18.782168"},{"key":"S1793830917500173BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46796-3_17"},{"key":"S1793830917500173BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/18.568705"},{"issue":"1","key":"S1793830917500173BIB004","first-page":"61","volume":"2","author":"Pandian P. Chella","year":"2014","journal-title":"Internat. J. Res. Appl."},{"key":"S1793830917500173BIB005","doi-asserted-by":"publisher","DOI":"10.5121\/ijit.2015.4401"},{"key":"S1793830917500173BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"S1793830917500173BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057227"},{"key":"S1793830917500173BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(93)90070-O"},{"key":"S1793830917500173BIB010","first-page":"R37","volume":"5","author":"Dodunekov S.","year":"1998","journal-title":"Electron. J. Commun."},{"key":"S1793830917500173BIB011","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.2000.0312"},{"key":"S1793830917500173BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"S1793830917500173BIB015","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008254008212"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:14:19Z","timestamp":1565183659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,4,13]]},"published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10.1142\/S1793830917500173"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500173","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}