{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:34:14Z","timestamp":1757313254669,"version":"3.41.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2127742","2127742","2127742"],"award-info":[{"award-number":["2127742","2127742","2127742"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10623-024-01550-3","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T14:47:24Z","timestamp":1735310844000},"page":"1597-1609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Codes from $$A_m$$-invariant polynomials"],"prefix":"10.1007","volume":"93","author":[{"given":"Giacomo","family":"Micheli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Pallozzi\u00a0Lavorante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillip","family":"Waitkevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"issue":"2","key":"1550_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ffa.2005.03.003","volume":"12","author":"A Cafure","year":"2006","unstructured":"Cafure A., Matera G.: Improved explicit estimates on the number of solutions of equations over a finite field. Finite Fields Their Appl. 12(2), 155\u2013185 (2006).","journal-title":"Finite Fields Their Appl."},{"issue":"3","key":"1550_CR2","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s10623-022-01123-2","volume":"91","author":"M Datta","year":"2023","unstructured":"Datta M., Johnsen T.: Codes from symmetric polynomials. Des. Codes Cryptogr. 91(3), 747\u2013761 (2023).","journal-title":"Des. Codes Cryptogr."},{"issue":"7","key":"1550_CR3","doi-asserted-by":"publisher","first-page":"4038","DOI":"10.1109\/TIT.2020.2975021","volume":"66","author":"RG D\u2019Oliveira","year":"2020","unstructured":"D\u2019Oliveira R.G., El Rouayheb S., Karpuk D.: Gasp codes for secure distributed matrix multiplication. IEEE Trans. Inf. Theory 66(7), 4038\u20134050 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1550_CR4","doi-asserted-by":"crossref","unstructured":"Garrison C., Micheli G., Nott L., Lavorante V.P., Waitkevich P.: On a class of optimal locally recoverable codes with availability. In: 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 2021\u20132026. IEEE (2023).","DOI":"10.1109\/ISIT54713.2023.10206840"},{"key":"1550_CR5","doi-asserted-by":"crossref","unstructured":"Hollanti C., Makkonen O., Sa\u00e7\u0131kara E.: Algebraic geometry codes for secure distributed matrix multiplication. arXiv preprint (2023). arXiv: 2303.15429.","DOI":"10.1109\/ITW55543.2023.10161614"},{"issue":"2","key":"1550_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: New generalizations of the reed-muller codes-I: primitive codes. IEEE Trans. Inf. Theory 14(2), 189\u2013199 (1968).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1550_CR7","doi-asserted-by":"crossref","unstructured":"L\u00f3pez H., Matthews G.L., Valvo D.: Secure MatDot codes: a secure, distributed matrix multiplication scheme. In: 2022 IEEE Information Theory Workshop (ITW), 2022, pp. 149\u2013154. IEEE (2022).","DOI":"10.1109\/ITW54588.2022.9965839"},{"issue":"1","key":"1550_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TIT.2019.2939464","volume":"66","author":"G Micheli","year":"2019","unstructured":"Micheli G.: Constructions of locally recoverable codes which are optimal. IEEE Trans. Inf. Theory 66(1), 167\u2013175 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1550_CR9","unstructured":"The SAGE Developers: SageMath, the Sage Mathematics Software System (Version 8.6). The SAGE Developers (2019). https:\/\/www.sagemath.org."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01550-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01550-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01550-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:54:30Z","timestamp":1750276470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01550-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1550"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01550-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"22 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}