{"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":1740131662902,"version":"3.37.3"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003329","name":"MINECO","doi-asserted-by":"publisher","award":["MTM2016-77445-P"],"award-info":[{"award-number":["MTM2016-77445-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007801","name":"Fundaci\u00f3n S\u00e9neca of Murcia","doi-asserted-by":"publisher","award":["19880\/GERM\/15"],"award-info":[{"award-number":["19880\/GERM\/15"]}],"id":[{"id":"10.13039\/100007801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tit.2020.3027751","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T21:54:16Z","timestamp":1601416456000},"page":"268-281","source":"Crossref","is-referenced-by-count":1,"title":["A New Approach to the Berlekamp-Massey-Sakata Algorithm: Improving Locator Decoding"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3087","authenticated-orcid":false,"given":"Jose Joaquin","family":"Bernal-Buitrago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6362-189X","authenticated-orcid":false,"given":"Juan Jacobo","family":"Simon-Pinero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90232-7"},{"article-title":"Gröbner bases for 0-dimensional ideals and applications to decoding","year":"1998","author":"rubio","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/9789814719261_0018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.476246"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056396"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80033-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.86974"},{"key":"ref17","article-title":"The BMS algorithm and decoding of AG codes","author":"sakata","year":"2010","journal-title":"Gröbner Bases Coding and Cryptography"},{"key":"ref18","article-title":"The BMS algorithm","author":"sakata","year":"2010","journal-title":"Gröbner Bases Coding and Cryptography"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807478"},{"key":"ref4","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.09.001"},{"journal-title":"Ideals Varieties and Algorithms","year":"1998","author":"cox","key":"ref6"},{"article-title":"Abelian codes","year":"1970","author":"camion","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.07.025"},{"key":"ref7","volume":"185","author":"cox","year":"2006","journal-title":"Using Algebraic Geometry"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868446"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512594"},{"article-title":"Multivariate polynomial codes","year":"2000","author":"hackl","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9300279\/09208797.pdf?arnumber=9208797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:24Z","timestamp":1652194464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9208797\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":19,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3027751","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}