{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:47Z","timestamp":1772283527182,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00436-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"65-74","source":"Crossref","is-referenced-by-count":9,"title":["On the non-minimal codewords in binary Reed\u2013Muller codes"],"prefix":"10.1016","volume":"128","author":[{"given":"Yuri","family":"Borissov","sequence":"first","affiliation":[]},{"given":"Nickolai","family":"Manev","sequence":"additional","affiliation":[]},{"given":"Svetla","family":"Nikova","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00436-5_BIB1","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/18.481810","article-title":"Voronoi regions for binary linear codes","volume":"42","author":"Agrell","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0166-218X(02)00436-5_BIB2","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1109\/18.705584","article-title":"Minimal vectors in linear codes","volume":"44","author":"Ashikhmin","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00436-5_BIB3","series-title":"Theory and Practice of Error Control Codes","author":"Blahut","year":"1984"},{"issue":"6","key":"10.1016\/S0166-218X(02)00436-5_BIB4","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/TIT.1970.1054545","article-title":"On the weight structure of Reed\u2013Muller codes","volume":"IT-16","author":"Kasami","year":"1970","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00436-5_BIB5","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/S0019-9958(76)90355-7","article-title":"On the weight enumeration of weights less than 2.5d of Reed\u2013Muller codes","volume":"30","author":"Kasami","year":"1976","journal-title":"Inform. and Control"},{"key":"10.1016\/S0166-218X(02)00436-5_BIB6","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0166-218X(02)00436-5_BIB7","unstructured":"J. Massey, Minimal codewords and secret sharing, in: Proceedings of the Sixth Joint Swedish\u2013Russian Workshop on Information Theory, Molle, Sweden, 1993, pp. 246\u2013249."},{"issue":"6","key":"10.1016\/S0166-218X(02)00436-5_BIB8","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1979.1056120","article-title":"Decoding linear block codes for minimizing word error rate","volume":"IT-25","author":"Hwang","year":"1979","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:30:16Z","timestamp":1553671816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004365"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00436-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}