{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T21:37:00Z","timestamp":1764020220166,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T00:00:00Z","timestamp":1532995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012530","name":"Gebze Technical University","doi-asserted-by":"crossref","award":["BAP 2015-A17"],"award-info":[{"award-number":["BAP 2015-A17"]}],"id":[{"id":"10.13039\/501100012530","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10623-018-0525-y","type":"journal-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T06:24:52Z","timestamp":1533018292000},"page":"317-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The covering radii of a class of binary cyclic codes and some BCH codes"],"prefix":"10.1007","volume":"87","author":[{"given":"Sel\u00e7uk","family":"Kavut","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5645-8174","authenticated-orcid":false,"given":"Seher","family":"Tutdere","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,31]]},"reference":[{"key":"525_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008299101833","volume":"10","author":"DS Cohen","year":"1997","unstructured":"Cohen D.S.: The lenght of primitive BCH codes with minimal covering radius. Des. Codes Cryptogr. 10, 5\u201316 (1997).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"525_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"31","author":"DG Cohen","year":"1985","unstructured":"Cohen D.G., Karpovsky M.G., Mattson Jr. H.F., Schatz J.R.: Covering radius-survey and recent results. IEEE Trans. Inf. Theory 31(3), 328\u2013343 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"525_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s002000050061","volume":"8","author":"GD Cohen","year":"1997","unstructured":"Cohen G.D., Litsyn S.N., Lobstein A.C., Mattson Jr. H.F.: Covering radius 1985\u20131994. Appl. Algebra Eng. Commun. Comput. 8(3), 173\u2013239 (1997).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"525_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: Four fundamental parameters of a code and their combinatorial significance. Inf. Control. 23, 407\u2013438 (1973).","journal-title":"Inf. Control."},{"issue":"3","key":"525_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0019-9958(60)90877-9","volume":"3","author":"D Gorenstein","year":"1960","unstructured":"Gorenstein D., Peterson W.W., Zierler N.: Two-error correcting Bose\u2013Chaudhuri codes are quasi-perfect. Inf. Control. 3(3), 291\u2013294 (1960).","journal-title":"Inf. Control."},{"key":"525_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/TIT.1978.1055847","volume":"24","author":"T Helleseth","year":"1978","unstructured":"Helleseth T.: All binary 3-error correcting BCH codes of lenght $$2^m-1$$ 2 m - 1 having covering radius $$5$$ 5 . IEEE Trans. Inf. Theory 24, 257\u2013258 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"525_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(85)80006-8","volume":"11","author":"T Helleseth","year":"1985","unstructured":"Helleseth T.: On the covering radius of cyclic linear codes and arithmetic codes. Discret. Appl. Math. 11(2), 157\u2013173 (1985).","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"525_CR8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1080\/00150517.2001.12428717","volume":"39","author":"FT Howard","year":"2001","unstructured":"Howard F.T.: The power of 2 dividing the coefficients of certain power series. Fibonacci Q. 39(4), 358\u2013363 (2001).","journal-title":"Fibonacci Q."},{"key":"525_CR9","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1109\/18.490570","volume":"42","author":"F Levy-dit-Vehel","year":"1996","unstructured":"Levy-dit-Vehel F., Litsyn S.: More on the covering radius of BCH codes. IEEE Trans. Inf. Theory 42, 1023\u20131028 (1996).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"525_CR10","doi-asserted-by":"publisher","first-page":"3299","DOI":"10.1109\/TIT.2003.820033","volume":"49","author":"O Moreno","year":"2003","unstructured":"Moreno O., Castro N.F.: Divisibility properties for covering radius of certain cyclic codes. IEEE Trans. Inf. Theory 49(12), 3299\u20133303 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"525_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.2307\/2375042","volume":"117","author":"O Moreno","year":"1995","unstructured":"Moreno O., Moreno C.J.: Improvement of Chevalley\u2013Warning and the Ax\u2013Katz Theorems. Am. J. Math. 117(1), 241\u2013244 (1995).","journal-title":"Am. J. Math."},{"key":"525_CR12","volume-title":"Error-Correcting Codes","author":"WW Peterson","year":"1972","unstructured":"Peterson W.W., Weldon E.J.: Error-Correcting Codes. MIT Press, Cambridge (1972)."},{"unstructured":"Skorobogatov A.N.: On the covering radius of BCH codes. In: Proc. Third Soviet-Swedish International Workshop on Information Theory, pp. 308\u2013309 (1987).","key":"525_CR13"},{"key":"525_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/18.50395","volume":"36","author":"A Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"Tiet\u00e4v\u00e4inen A.: An asymptotic bound on the covering radii of binary BCH codes. IEEE Trans. Inf. Theory 36, 211\u2013213 (1990).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"525_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(87)90055-2","volume":"16","author":"A Tiet\u00e4v\u00e4inen","year":"1987","unstructured":"Tiet\u00e4v\u00e4inen A.: On the covering radius of long binary BCH codes. Discret. Appl. Math. 16(1), 75\u201377 (1987).","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"525_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TIT.1976.1055530","volume":"22","author":"J Horst Van der","year":"1976","unstructured":"Van der Horst J., Berger T.: Complete decoding of triple-error-correcting binary BCH codes. IEEE Trans. Inf. Theory 22(2), 138\u2013147 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"525_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1986.1057134","volume":"32","author":"JH Lint Van","year":"1986","unstructured":"Van Lint J.H., Wilson R.: On the minimum distance of cyclic codes. IEEE Trans. Inf. Theory 32(1), 23\u201340 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Vl\u00e3duts S.G., Skorobogatov A.N.: Covering radius for long BCH codes. Problemy Peredachi Informatsii 25, 38\u201345 (1989). Translated in: Probl. Inf. Transm. 25(1), 28\u201334 (1989).","key":"525_CR18"},{"key":"525_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"FM Williams","year":"1977","unstructured":"Williams F.M., Sloane N.J.: The Theory of Error-Correcting Codes. Bell Laboratories, Murray Hill (1977)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0525-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0525-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0525-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T03:48:13Z","timestamp":1751773693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0525-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,31]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["525"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0525-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,7,31]]},"assertion":[{"value":"15 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}