{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:11Z","timestamp":1759335311306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031422492"},{"type":"electronic","value":"9783031422508"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42250-8_8","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T09:28:55Z","timestamp":1692782935000},"page":"105-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Minimum Distance of\u00a0Subspace Codes Generated by\u00a0Linear Cellular Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3089-6517","authenticated-orcid":false,"given":"Luca","family":"Mariot","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6316-6409","authenticated-orcid":false,"given":"Federico","family":"Mazzone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11555964_7","volume-title":"Computer Algebra in Scientific Computing","author":"L Bus\u00e9","year":"2005","unstructured":"Bus\u00e9, L., Khalil, H., Mourrain, B.: Resultant-based methods for plane curves intersection problems. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 75\u201392. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555964_7"},{"issue":"7","key":"8_CR2","doi-asserted-by":"publisher","first-page":"4131","DOI":"10.1109\/TIT.2019.2899748","volume":"65","author":"T Etzion","year":"2019","unstructured":"Etzion, T., Zhang, H.: Grassmannian codes with new distance measures for network coding. IEEE Trans. Inf. Theory 65(7), 4131\u20134142 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR3","unstructured":"Gadouleau, M., Mariot, L., Picek, S.: Bent functions from cellular automata. IACR Cryptology ePrint Archive, p. 1272 (2020)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-022-01097-1","volume":"91","author":"M Gadouleau","year":"2023","unstructured":"Gadouleau, M., Mariot, L., Picek, S.: Bent functions in the partial spread class generated by linear recurring sequences. Des. Codes Cryptogr. 91(1), 63\u201382 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Gau\u00df, C.F.: Disquisitiones arithmeticae. Humboldt-Universit\u00e4t zu Berlin (1801)","DOI":"10.5479\/sil.324926.39088000932822"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants, and Multidimensional Determinants","author":"IM Gelfand","year":"2008","unstructured":"Gelfand, I.M., Kapranov, M., Zelevinsky, A.: Discriminants, Resultants, and Multidimensional Determinants. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-8176-4771-1"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ffa.2013.11.007","volume":"26","author":"E Gorla","year":"2014","unstructured":"Gorla, E., Ravagnani, A.: Partial spreads in random network coding. Finite Fields Their Appl. 26, 104\u2013115 (2014)","journal-title":"Finite Fields Their Appl."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10868-6_1","volume-title":"Cryptography and Coding","author":"A Khaleghi","year":"2009","unstructured":"Khaleghi, A., Silva, D., Kschischang, F.R.: Subspace codes. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 1\u201321. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10868-6_1"},{"issue":"8","key":"8_CR9","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Kschischang, F.R.: An introduction to network coding. In: Network Coding, pp. 1\u201337. Elsevier (2012)","DOI":"10.1016\/B978-0-12-380918-6.00001-9"},{"key":"8_CR11","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10623-019-00689-8","volume":"88","author":"L Mariot","year":"2020","unstructured":"Mariot, L., Gadouleau, M., Formenti, E., Leporati, A.: Mutually orthogonal Latin squares based on cellular automata. Des. Codes Cryptogr. 88(2), 391\u2013411 (2020)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11047-017-9635-0","volume":"17","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Leporati, A.: A cryptographic and coding-theoretic perspective on the global rules of cellular automata. Nat. Comput. 17(3), 487\u2013498 (2018)","journal-title":"Nat. Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-99813-8_33","volume-title":"Cellular Automata","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Leporati, A.: Inversion of mutually orthogonal cellular automata. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 364\u2013376. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99813-8_33"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11047-016-9586-x","volume":"16","author":"L Mariot","year":"2017","unstructured":"Mariot, L., Leporati, A., Dennunzio, A., Formenti, E.: Computing the periods of preimages in surjective cellular automata. Nat. Comput. 16(3), 367\u2013381 (2017)","journal-title":"Nat. Comput."},{"key":"8_CR16","volume-title":"Network Coding: Fundamentals and Applications","author":"M M\u00e9dard","year":"2011","unstructured":"M\u00e9dard, M., Sprintson, A.: Network Coding: Fundamentals and Applications. Academic Press, Cambridge (2011)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Zeng, Z.: The numerical greatest common divisor of univariate polynomials. In: Randomization, Relaxation, and Complexity in Polynomial Equation Solving, vol. 556 (2011)","DOI":"10.1090\/conm\/556\/11014"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42250-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T09:29:34Z","timestamp":1692782974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42250-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031422492","9783031422508"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42250-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/automata2023.units.it\/","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":"11","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":"7","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":"0","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":"64% - 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","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","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)"}},{"value":"For 2022, 3 papers have been accepted from 18 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}