{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:30:49Z","timestamp":1753889449672},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0166-218x(91)90104-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"3-9","source":"Crossref","is-referenced-by-count":5,"title":["A note on the covering radius of optimum codes"],"prefix":"10.1016","volume":"33","author":[{"given":"M.C.","family":"Bhandari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.S.","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90104-5_bib1","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TIT.1986.1057229","article-title":"Subcodes and covering radius","volume":"32","author":"Adams","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TIT.1973.1054939","article-title":"A note on the Griesmer bound","volume":"19","author":"Baumert","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","article-title":"Weight distributions of the cosets of the (32,6) Reed-Muller Code","volume":"18","author":"Berlekamp","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TIT.1985.1057073","article-title":"On the covering radius of binary linear codes meeting the Griesmer bound","volume":"31","author":"Busschbach","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius-survey and recent results","volume":"31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib6","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","article-title":"Further results on the covering radius of codes","volume":"32","author":"Cohen","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib7","first-page":"8","article-title":"Minimum possible block length of a linear binary code for some distances","volume":"20","author":"Dodunekov","year":"1984","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0166-218X(91)90104-5_bib8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(85)90064-2","article-title":"An improvement of the Griesmer bound for some small minimum distances","volume":"12","author":"Dodunekov","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(91)90104-5_bib9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","article-title":"On the covering radius of codes","volume":"31","author":"Graham","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib10","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","article-title":"A bound for error correcting codes","volume":"4","author":"Griesmer","year":"1960","journal-title":"IBM J Res. Develop."},{"key":"10.1016\/0166-218X(91)90104-5_bib11","series-title":"A First Course in Coding Theory","author":"Hill","year":"1986"},{"key":"10.1016\/0166-218X(91)90104-5_bib12","series-title":"Ph.D. Thesis","article-title":"Relations among parameters of codes","author":"Janwa","year":"1986"},{"key":"10.1016\/0166-218X(91)90104-5_bib13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/18.42182","article-title":"Some new upper bounds on the covering radius of binary linear codes","volume":"35","author":"Janwa","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90104-5_bib14","doi-asserted-by":"crossref","unstructured":"H. Janwa, Some optimal codes from algebraic geometry and their covering radii, presented at IMA Conference, June 88; European J. Combin., to appear.","DOI":"10.1016\/S0195-6698(13)80125-4"},{"key":"10.1016\/0166-218X(91)90104-5_bib15","series-title":"The theory of error correcting codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0166-218X(91)90104-5_bib16","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","article-title":"On the uniqueness resp. non-existence of certain codes meeting the Griesmer bound","volume":"44","author":"van Tilborg","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90104-5_bib17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(81)90166-7","article-title":"The smallest length of binary 7-dimensional linear codes with prescribed minimum distance","volume":"33","author":"van Tilborg","year":"1981","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:21:43Z","timestamp":1555122103000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91901045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0166218X91901045"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90104-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}