{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:19:49Z","timestamp":1773429589223,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1007\/bf01388415","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T08:31:01Z","timestamp":1112430661000},"page":"167-177","source":"Crossref","is-referenced-by-count":14,"title":["Further results on the covering radii of the Reed-Muller codes"],"prefix":"10.1007","volume":"3","author":[{"given":"Xiang-Dong","family":"Hou","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","volume":"18","author":"E. Berlekamp","year":"1972","unstructured":"Berlekamp, E. and Welch, L.R. 1972. Weight distributions of the cosets of the (32, 6) Reed-Muller code.IEEE Trans. Inform. Theory IT-18:203?207.","journal-title":"IEEE Trans. Inform. Theory IT"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"31","author":"G.D. Cohen","year":"1985","unstructured":"Cohen, G.D., Karpovsky, M.G., Mattson, H.F. Jr. and Schatz, J.R. 1985. Covering radius?survey and recent results.IEEE Trans. Inform. Theory, IT-31:328?343.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","volume":"24","author":"T. Helleseth","year":"1978","unstructured":"Helleseth, T., Kl\u00f8ve, T. and Mykkeltveit, J. 1978. On the covering radius of binary codes.IEEE Trans. Inform. Theory, IT-24:627?628.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF00141965","volume":"2","author":"X. Hou","year":"1992","unstructured":"Hou, X. 1992. Some inequalities about the covering radius of Reed-Muller codes.Des. Codes Cryptogr., 2:215?224.","journal-title":"Des. Codes Cryptogr."},{"key":"CR5","unstructured":"Hou, X. Classification of cosets of the Reed-Muller codeR(m?1,m).Discrete Math., to appear."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Hou, X. 1993. Some results on the covering radii of Reed-Muller codes.IEEE Trans. Inform. Theory, to appear.","DOI":"10.1109\/18.212268"},{"key":"CR7","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-54303-1_117","volume-title":"The covering radius ofRM(1, 9) intoRM(3, 9).Eurocode 90","author":"P. Langevin","year":"1991","unstructured":"Langevin, P. 1991. The covering radius ofRM(1, 9) intoRM(3, 9).Eurocode 90, pp. 51?59,Lecture Notes in Comput. Sci., 514, Berlin: Springer."},{"key":"CR8","unstructured":"Langevin, P. On the orphans and covering radius of the Reed-Muller codes. Preprint."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0137032","volume":"37","author":"A. McLoughlin","year":"1979","unstructured":"McLoughlin, A. 1979. The covering radius of the (m?3)rd order Reed-Muller codes and a lower bound on the (m?4)th order Reed-Muller codes.SIAM J. Appl. Math., 37:419?422.","journal-title":"SIAM J. Appl. Math."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TIT.1980.1056187","volume":"26","author":"J. Mykkeltveit","year":"1980","unstructured":"Mykkeltveit, J. 1980. The covering radius of the (128, 8) Reed-Muller code is 56.IEEE Trans. Inform. Theory, IT-26:359?362.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TIT.1983.1056679","volume":"29","author":"N.J. Patterson","year":"1983","unstructured":"Patterson, N.J. and Wiedemann, D.H. 1983. The covering radius of the (215, 16) Reed-Muller code is at least 16276.IEEE Trans. Inform. Theory, IT-29: 354?356.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR12","first-page":"443","volume":"36","author":"N.J. Patterson","year":"1990","unstructured":"Patterson, N.J. and Wiedemann, D.H. 1990. Correction to [11],IEEE Trans. Inform. Theory, IT-36: 443.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"issue":"A","key":"CR13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O. Rothaus","year":"1976","unstructured":"Rothaus, O. 1976. On ?bent? functions.J. Combin. Theory, 20(A): 300?305.","journal-title":"J. Combin. Theory"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/TIT.1981.1056364","volume":"27","author":"J.R. Schatz","year":"1981","unstructured":"Schatz, J.R. 1981. The second order Reed-Muller code of length 64 has covering radius 18.IEEE Trans. Inform. Theory, IT-27: 529?530.","journal-title":"IEEE Trans. Inform. Theory, IT"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388415\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388415.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388415\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:14:18Z","timestamp":1556813658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01388415"],"URL":"https:\/\/doi.org\/10.1007\/bf01388415","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}