{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:44:04Z","timestamp":1729662244577,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itcc.2003.1197530","type":"proceedings-article","created":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T14:43:37Z","timestamp":1084459417000},"page":"221-225","source":"Crossref","is-referenced-by-count":3,"title":["A note on covering radius of MacDonald codes"],"prefix":"10.1109","author":[{"given":"M.C.","family":"Bhandari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Durairajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055315"},{"article-title":"On optimum codes and their covering radii","year":"1990","author":"garg","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.272479"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-16767-6_53","article-title":"An improved upper bound on covering radius","volume":"228","author":"mattson","year":"1975","journal-title":"Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90104-5"},{"key":"ref5","article-title":"On the covering radius of the simplex codes to appear","author":"bhandari","year":"0","journal-title":"Journal of Discrete Mathematical Science & Cryptography"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124893"},{"key":"ref7","first-page":"239","article-title":"Minimal block length of a linear q-ary code with specified dimension and code distance","volume":"20","author":"dodunekov","year":"1985","journal-title":"Problems Inform Transmission"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1147\/rd.41.0043"}],"event":{"name":"ITCC 2003. International Conference on Information Technology: Coding and Computing","acronym":"ITCC-03","location":"Las Vegas, NV, USA"},"container-title":["Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8532\/26947\/01197530.pdf?arnumber=1197530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:02:08Z","timestamp":1497596528000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1197530\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/itcc.2003.1197530","relation":{},"subject":[]}}