{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:36Z","timestamp":1726072536539},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_17","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"218-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing an Invariant of a Linear Code"],"prefix":"10.1007","author":[{"given":"Mijail","family":"Borges-Quintana","sequence":"first","affiliation":[]},{"given":"Miguel \u00c1ngel","family":"Borges-Trenard","sequence":"additional","affiliation":[]},{"given":"Edgar","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[]},{"given":"Gustavo","family":"Torres-Guerrero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.: Code equivalence and group isomorphism. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1395\u20131408. Society for Industrial and Applied Mathematics (2011)","DOI":"10.1137\/1.9781611973082.107"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31703-1","volume-title":"Error-Correcting Linear Codes: Classification by Isometry and Applications","author":"A Betten","year":"2006","unstructured":"Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes: Classification by Isometry and Applications, vol. 18. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-31703-1"},{"issue":"8","key":"17_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1142\/S0219498815501285","volume":"14","author":"M Borges-Quintana","year":"2015","unstructured":"Borges-Quintana, M., Borges-Trenard, M., M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E.: Computing coset leaders and leader codewords of binary codes. J. Algebra Appl. 14(8), 19 (2015)","journal-title":"J. Algebra Appl."},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/09720529.2007.10698114","volume":"10","author":"M Borges-Quintana","year":"2007","unstructured":"Borges-Quintana, M., Borges-Trenard, M., Mart\u00ednez-Moro, E.: On a Gr\u00f6bner bases structure associated to linear codes. J. Discrete Math. Sci. Cryptogr. 10(2), 151\u2013191 (2007)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11786-018-0349-1","volume":"12","author":"M Borges-Quintana","year":"2018","unstructured":"Borges-Quintana, M., Borges-Trenard, M., Mart\u00ednez-Moro, E.: On the weak order ideal associated to linear codes. Math. Comput. Sci. 12(3), 339\u2013347 (2018)","journal-title":"Math. Comput. Sci."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1137\/140977990","volume":"30","author":"G Braun","year":"2016","unstructured":"Braun, G., Pokutta, S.: A polyhedral characterization of border bases. SIAM J. Discrete Math. 30(1), 239\u2013265 (2016)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1109\/TIT.2005.844080","volume":"51","author":"T Helleseth","year":"2005","unstructured":"Helleseth, T., Kl\u00f8ve, T., Levenshtein, V.I.: Error-correction capability of binary linear codes. IEEE Trans. Inf. Theory 51(4), 1408\u20131423 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"JS Leon","year":"1982","unstructured":"Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inform. Theory 28, 496\u2013511 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107340954","volume-title":"Solving Polynomial Equation Systems II: Macaulay\u2019s Paradigm and Gr\u00f6bner Technology","author":"T Mora","year":"2005","unstructured":"Mora, T.: Solving Polynomial Equation Systems II: Macaulay\u2019s Paradigm and Gr\u00f6bner Technology. Cambridge University Press, Cambridge (2005)"},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.: Is code equivalence easy to decide? IEEE Trans. Inform. Theory 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendier","year":"2000","unstructured":"Sendier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inform. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR12","unstructured":"Sendier, N., Simos, D.: How easy is code equivalence over $$\\mathbb{F}_q$$? In: International Workshop on Coding and Cryptography (2013). \nhttps:\/\/www.rocq.inria.fr\/secret\/PUBLICATIONS\/codeq3.pdf"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2013","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\mathbb{F}_q$$ and its application to code-based cryptography. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 203\u2013216. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38616-9_14"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:14:53Z","timestamp":1584490493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","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":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"14","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":"33% - 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":"2,1","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":"5,8","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)"}}]}}