{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:22Z","timestamp":1740131662917,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"MINECO","award":["MTM2016-77445-P"],"award-info":[{"award-number":["MTM2016-77445-P"]}]},{"DOI":"10.13039\/100007801","name":"Fundaci\u00f3n S\u00e9neca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["PDE 233497\/2014-5"],"award-info":[{"award-number":["PDE 233497\/2014-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tit.2018.2868446","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T22:55:11Z","timestamp":1536015311000},"page":"1752-1763","source":"Crossref","is-referenced-by-count":3,"title":["From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3087","authenticated-orcid":false,"given":"J. J.","family":"Bernal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Guerreiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6362-189X","authenticated-orcid":false,"given":"J. J.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.3934\/amc.2016018","article-title":"Cyclic and BCH codes whose minimum distance equals their maximum BCH bound","volume":"10","author":"bueno-carre\u00f1o","year":"2016","journal-title":"Adv Math Commun"},{"article-title":"Abelian codes","year":"1970","author":"camion","key":"ref11"},{"journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes","year":"2018","author":"grassl","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055555"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90232-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057109"},{"key":"ref17","first-page":"409","article-title":"A decoding method up to the Hartmann-Tzeng bound using the DFT for cyclic codes","author":"kaida","year":"2007","journal-title":"Proc Asia–Pacific Conf Commun"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055915"},{"key":"ref4","first-page":"712","article-title":"Ds-bounds for cyclic codes: New bounds for abelian codes","author":"bernal","year":"2016","journal-title":"Proc ISITA"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512594"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.876240"},{"journal-title":"A Theory for the Distance of Cyclic Codes","year":"2007","author":"betti","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.212301"},{"key":"ref7","first-page":"1569","article-title":"Decoding of cyclic codes and codes on curves","volume":"2","author":"blahut","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2259141"},{"key":"ref9","first-page":"109","article-title":"A characterization of cyclic codes whose minimum distance equals their maximum BCH bound","author":"bernal","year":"2013","journal-title":"Proc ACAT"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055222"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056672"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01268659"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90014-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057134"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.86974"},{"key":"ref26","first-page":"441","article-title":"The designed minimum distance of medium lengths for binary cyclic codes","author":"zheng","year":"2012","journal-title":"Proc ISITA"},{"key":"ref25","first-page":"34","article-title":"Hypermatrix and its applications","volume":"6","author":"yamada","year":"1965","journal-title":"Hitotsubashi J Arts Sci"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8642547\/08453866.pdf?arnumber=8453866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:14Z","timestamp":1657745534000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8453866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":26,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2868446","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}