{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:04Z","timestamp":1757313424519,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["2.9214.2017"],"award-info":[{"award-number":["2.9214.2017"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tit.2018.2867839","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T19:27:44Z","timestamp":1535657264000},"page":"7171-7177","source":"Crossref","is-referenced-by-count":3,"title":["Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0924-6221","authenticated-orcid":false,"given":"Sergey V.","family":"Bezzateev","sequence":"first","affiliation":[]},{"given":"Natalia A.","family":"Shekhunova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80054-6"},{"key":"ref12","first-page":"1","author":"tiet\u00e4v\u00e4inen","year":"1989","journal-title":"Codes and Character Sums"},{"key":"ref13","first-page":"24","article-title":"A new class of linear correcting codes","volume":"6","author":"goppa","year":"1970","journal-title":"Problemy Peredachi Informat"},{"journal-title":"Results on the covering radius of some best known binary codes","year":"2011","author":"grassl","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055098"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055449"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056089"},{"key":"ref18","first-page":"14","article-title":"On cyclicity of extended Goppa codes","volume":"18","author":"vishnevetskii","year":"1982","journal-title":"Problemy Peredachi Informat"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90045-9"},{"key":"ref4","first-page":"38","article-title":"Covering radius for long BCH codes","volume":"25","author":"vl?du?","year":"1989","journal-title":"Problemy Peredachi Informat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057227"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2048345"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.641547"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050061"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref9","article-title":"Goppa codes related quasi-perfect double-error-correcting codes","author":"moreno","year":"1981","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref1","first-page":"601","article-title":"On codes with given minimum distance and covering radius","volume":"42","author":"quistorff","year":"2001","journal-title":"Contrib Algebra Geometry"},{"key":"ref20","first-page":"107","article-title":"Codes constructed on the base of (L, g)-codes","volume":"8","author":"goppa","year":"1972","journal-title":"Problemy Peredachi Informat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90020-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.03.006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2371075"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0173-4"},{"key":"ref26","first-page":"233","article-title":"Class of binary generalized Goppa codes perfect in weighted Hamming metric","author":"bezzateev","year":"2011","journal-title":"Proc Workshop on Coding and Cryptography (WCC)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9739-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8497120\/08451975.pdf?arnumber=8451975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T15:21:46Z","timestamp":1643210506000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8451975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":26,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2867839","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}