{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:27:11Z","timestamp":1758126431924},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":7624,"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":[[1992,9]]},"DOI":"10.1016\/0012-365x(92)90542-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"147-155","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["On the covering radius of Reed-Muller codes"],"prefix":"10.1016","volume":"106-107","author":[{"given":"G\u00e9rard D.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon N.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0012-365X(92)90542-N_BIB1","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\/0012-365X(92)90542-N_BIB2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0137032","article-title":"The covering radius of the (m\u22123)rd order Reed-Muller codes and a lower bound on the (m\u22124)th order Reed-Muller codes","volume":"37","author":"McLoughlin","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(92)90542-N_BIB3","article-title":"Coding Theory","volume":"Vol. 201","author":"van Lint","year":"1973"},{"key":"10.1016\/0012-365X(92)90542-N_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00123957","article-title":"Covering radius and dual distance","author":"Tiet\u00e4v\u00e4inen","year":"1991","journal-title":"Designs, Codes Cryptography"},{"issue":"6","key":"10.1016\/0012-365X(92)90542-N_BIB5","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.59948","article-title":"Asymptotic bounds on the covering radius of binary codes","volume":"36","author":"Sol\u00e9","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:0012365X9290542N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290542N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:11Z","timestamp":1555120211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290542N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":5,"alternative-id":["0012365X9290542N"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90542-n","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}