{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:05:45Z","timestamp":1754161545773,"version":"3.41.2"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008297926857","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"75-82","source":"Crossref","is-referenced-by-count":0,"title":["The Reed-Muller Code R(1,7) Is Normal"],"prefix":"10.1007","volume":"12","author":[{"given":"Xiang-Dong","family":"Hou","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"136849_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(92)90118-Y","volume":"102","author":"R. A. Brualdi","year":"1992","unstructured":"R. A. Brualdi, N. Cai, and V. S. Pless, Orphans structure of the first order Reed-Muller codes, Discrete Math., Vol. 102, (1992) pp. 239\u2013247.","journal-title":"Discrete Math."},{"issue":"3","key":"136849_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"IT-31","author":"R. L. Graham","year":"1985","unstructured":"R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. IT-31,No. 3 (1985) pp. 385\u2013401.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"136849_CR3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","volume":"IT-24","author":"T. Helleseth","year":"1978","unstructured":"T. Helleseth, T. Kl\u00f8ve, and J. Mykkeltveit, On the covering radius of binary codes, IEEE Inform. Theory, Vol. IT-24,No. 5 (1978) pp. 627\u2013628.","journal-title":"IEEE Inform. Theory"},{"key":"136849_CR4","volume-title":"Covering radius of error-correcting codes","author":"X. Hou","year":"1990","unstructured":"X. Hou, Covering radius of error-correcting codes, Ph.D. Thesis, University of Illinois at Chicago (1990)."},{"issue":"2","key":"136849_CR5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/18.75258","volume":"IT-37","author":"X. Hou","year":"1991","unstructured":"X. Hou, Binary linear quasi-perfect codes are normal, IEEE Trans. Inform. Theory, Vol. IT-37,No. 2 (1991) pp. 378\u2013379.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136849_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1006\/jcta.1996.0055","volume":"74","author":"X. Hou","year":"1996","unstructured":"X. Hou, Covering radius of the Reed-Muller code R(1, 7)--A simpler proof, J. Combin. Theory A, Vol. 74 (1996) pp. 337\u2013341.","journal-title":"J. Combin. Theory A"},{"key":"136849_CR7","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-54522-0_112","volume-title":"On the orphans and covering radius of the Reed-Muller codes","author":"P. Langevin","year":"1991","unstructured":"P. Langevin, On the orphans and covering radius of the Reed-Muller codes, Lecture Notes in Comput. Sci., Springer, Berlin, 539 (1991) pp. 234\u2013240."},{"issue":"3","key":"136849_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TIT.1980.1056187","volume":"IT-26","author":"J. Mykkeltveit","year":"1980","unstructured":"J. Mykkeltveit, The covering radius of the (128,8) Reed-Muller code is 56, IEEE Inform. Theory, Vol. IT-26,No. 3 (1980) pp. 359\u2013362.","journal-title":"IEEE Inform. Theory"},{"key":"136849_CR9","volume-title":"Introduction to the Theory of Error-Correcting Codes","author":"V. Pless","year":"1989","unstructured":"V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed., Wiley, New York, (1989).","edition":"2nd ed."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008297926857.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008297926857\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008297926857.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:30:02Z","timestamp":1753756202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008297926857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136849"],"URL":"https:\/\/doi.org\/10.1023\/a:1008297926857","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}