{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:25:42Z","timestamp":1743013542245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688684"},{"type":"electronic","value":"9783030688691"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68869-1_7","type":"book-chapter","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:24:44Z","timestamp":1613694284000},"page":"134-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decoding up to 4 Errors in Hyperbolic-Like Abelian Codes by the Sakata Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3087","authenticated-orcid":false,"given":"Jos\u00e9 Joaqu\u00edn","family":"Bernal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6362-189X","authenticated-orcid":false,"given":"Juan Jacobo","family":"Sim\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/TIT.2015.2512594","volume":"62","author":"JJ Bernal","year":"2016","unstructured":"Bernal, J.J., Bueno-Carre\u00f1o, D.H., Sim\u00f3n, J.J.: Apparent distance and a notion of BCH multivariate codes. IEEE Trans. Inf. Theory 62(2), 655\u2013668 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR2","unstructured":"Blahut, R.E.: Decoding of cyclic codes and codes on curves. In: Huffman, W.C., Pless, V. (eds.) Handbook of Coding Theory, vol. II, pp. 1569\u20131633 (1998)"},{"key":"7_CR3","unstructured":"Camion, P.: Abelian codes. MCR Tech. Sum. Rep. 1059, University of Wisconsin, Madison (1970)"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-41154-4","volume-title":"Ideals, Varieties, and Algorithms","author":"DA Cox","year":"1998","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-662-41154-4"},{"key":"7_CR5","unstructured":"Hackl, M.: Multivariate polynomial codes. Johannes-Kepler-University (2000)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(77)90232-7","volume":"34","author":"H Imai","year":"1977","unstructured":"Imai, H.: A theory of two-dimensional cyclic codes. Inf. Control 34(1), 1\u201321 (1977)","journal-title":"Inf. Control"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Rubio, I.M., Sweedler, M., Heegard, C.: Finding a Gr\u00f6bner basis for the ideal of recurrence relations on m-dimensional periodic arrays. In: 12th International Conference on Finite Fields and Their Applications, Contemporary Developments in Finite Fields and Applications, pp. 296\u2013320. World Scientific (2016)","DOI":"10.1142\/9789814719261_0018"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0747-7171(88)80033-6","volume":"5","author":"S Sakata","year":"1988","unstructured":"Sakata, S.: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array. J. Symb. Comput. 5, 321\u2013337 (1988)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/18.86974","volume":"37","author":"S Sakata","year":"1991","unstructured":"Sakata, S.: Decoding binary cyclic 2-D codes by the 2-D Berlekamp-Massey algorithm. IEEE Trans. Inf. Theory 37(4), 1200\u20131203 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-93806-4_10","volume-title":"Gr\u00f6bner Basis, Coding, and Cryptography","author":"S Sakata","year":"2010","unstructured":"Sakata, S.: The BMS algorithm and decoding of AG codes. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds.) Gr\u00f6bner Basis, Coding, and Cryptography, pp. 165\u2013185. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-93806-4_10"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-93806-4_9","volume-title":"Gr\u00f6bner Basis, Coding, and Cryptography","author":"S Sakata","year":"2010","unstructured":"Sakata, S.: The BMS Algorithm. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds.) Gr\u00f6bner Basis, Coding, and Cryptography, pp. 143\u2013163. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-93806-4_9"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68869-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:26:16Z","timestamp":1613694376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68869-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688684","9783030688691"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68869-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}