{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:34:15Z","timestamp":1648949655828},"reference-count":11,"publisher":"Elsevier BV","issue":"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 Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0012-365x(91)90028-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"229-232","source":"Crossref","is-referenced-by-count":7,"title":["All binary codes with covering radius one are subnormal"],"prefix":"10.1016","volume":"94","author":[{"given":"Iiro","family":"Honkala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90028-Z_BIB1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius\u2014survey and recent results","volume":"31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB2","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\/0012-365X(91)90028-Z_BIB3","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\/0012-365X(91)90028-Z_BIB4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/18.2644","article-title":"Lower bounds for binary covering codes","volume":"34","author":"Honkala","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/18.75253","article-title":"Modified bounds for covering codes","volume":"37","author":"Honkala","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/18.75256","article-title":"Bounds for abnormal binary codes with covering radius one","volume":"37","author":"Honkala","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB7","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0608050","article-title":"On the covering radius problem for codes II. Codes of low dimension; normal and abnormal codes","volume":"8","author":"Kilby","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB8_1","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/18.45285","article-title":"On normal and subnormal q-ary codes","volume":"35","author":"Lobstein","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB8_2","first-page":"1498","article-title":"On normal and subnormal q-ary codes","volume":"36","author":"Lobstein","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/18.2632","article-title":"Improved sphere bounds on the covering radius of codes","volume":"34","author":"van Wee","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(91)90028-Z_BIB10","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1109\/18.59947","article-title":"More binary covering codes are normal","volume":"36","author":"van Wee","year":"1990","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190028Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190028Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:48Z","timestamp":1555136568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190028Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0012365X9190028Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90028-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}