{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:42:24Z","timestamp":1760553744049,"version":"build-2065373602"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T00:00:00Z","timestamp":1752796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T00:00:00Z","timestamp":1752796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007515","name":"Universidad de Valladolid","doi-asserted-by":"publisher","award":["E-47-2022-0001486","E-47-2022-0001486"],"award-info":[{"award-number":["E-47-2022-0001486","E-47-2022-0001486"]}],"id":[{"id":"10.13039\/501100007515","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["TED2021-130358B-I00","TED2021-130358B-I00"],"award-info":[{"award-number":["TED2021-130358B-I00","TED2021-130358B-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007515","name":"Universidad de Valladolid","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007515","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The problem of distributed matrix multiplication with straggler tolerance over finite fields is considered, focusing on field sizes for which previous solutions were not applicable (for instance, the field of two elements). We employ Reed-Muller-type codes for explicitly constructing the desired algorithms and study their parameters by translating the problem into a combinatorial problem involving sums of discrete convex sets. We generalize polynomial codes and matdot codes, discussing the impossibility of the latter being applicable for very small field sizes, while providing optimal solutions for some regimes of parameters in both cases.<\/jats:p>","DOI":"10.1007\/s10623-025-01689-7","type":"journal-article","created":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T05:51:01Z","timestamp":1752817861000},"page":"4545-4565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed matrix multiplication with straggler tolerance over very small fields"],"prefix":"10.1007","volume":"93","author":[{"given":"Adri\u00e1n","family":"Fidalgo-D\u00edaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"1689_CR1","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.-C., Gaborit, P., Ghosh, S., Gueron, S., G\u00fcneysu, T., et al.: Bike: bit flipping key encapsulation. HAL hal04278509 (2022)"},{"key":"1689_CR2","doi-asserted-by":"crossref","unstructured":"Pellikaan, R., Wu, X.-W., Bulygin, S., Jurrius, R.: Codes, cryptology and curves with computer algebra vol. 1. Cambridge University Press, University Printing house, Cambridge CB2 8BS, United Kingdom (2017)","DOI":"10.1017\/9780511982170"},{"key":"1689_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Post-Quantum Cryptography: Second International Workshop, PQCrypto 2008 Cincinnati, OH, USA, October 17\u201319, 2008 Proceedings 2, Springer. pp. 31\u201346 (2008)","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"1689_CR4","first-page":"1","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"1997","unstructured":"Cox D., Little J., O\u2019shea D., Sweedler M.: Ideals, Varieties, and Algorithms, vol. 3, p. 1. Springer, Switzerland (1997)."},{"key":"1689_CR5","unstructured":"Yu, Q., Maddah-Ali, M., Avestimehr, S.: Polynomial codes: an optimal design for high-dimensional coded matrix multiplication. Adv. Neural Inform. Process. Syst. 30 (2017)"},{"issue":"1","key":"1689_CR6","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TIT.2019.2929328","volume":"66","author":"S Dutta","year":"2020","unstructured":"Dutta S., Fahim M., Haddadpour F., Jeong H., Cadambe V., Grover P.: On the optimal recovery threshold of coded matrix multiplication. IEEE Trans. Inform. Theory 66(1), 278\u2013301 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1689_CR7","doi-asserted-by":"crossref","unstructured":"Fidalgo-D\u00edaz, A., Mart\u00ednez-Pe\u00f1as, U.: Distributed matrix multiplication with straggler tolerance using algebraic function fields. International Symposium on Information Theory (2024)","DOI":"10.1109\/ISIT57864.2024.10619418"},{"key":"1689_CR8","doi-asserted-by":"crossref","unstructured":"Machado, R.A., Matthews, G.L., Santos, W.: Hera scheme: secure distributed matrix multiplication via Hermitian codes. In: 2023 IEEE International Symposium on Information Theory (ISIT), IEEE. pp. 1729\u20131734 (2023)","DOI":"10.1109\/ISIT54713.2023.10206764"},{"key":"1689_CR9","doi-asserted-by":"crossref","unstructured":"Makkonen, O., Sa\u00e7\u0131kara, E., Hollanti, C.: Algebraic geometry codes for secure distributed matrix multiplication (2023)","DOI":"10.1109\/ITW55543.2023.10161614"},{"key":"1689_CR10","doi-asserted-by":"crossref","unstructured":"Matthews, G.L., Soto, P.: Algebraic geometric rook codes for coded distributed computing. Preprint at arXiv:2405.09746 (2024)","DOI":"10.1109\/ITW61385.2024.10807041"},{"key":"1689_CR11","unstructured":"Li, J., Li, S., Xing, C.: Algebraic geometry codes for distributed matrix multiplication using local expansions. Preprint at arXiv: 2408.01806 (2024)"},{"issue":"2","key":"1689_CR12","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/18.825832","volume":"46","author":"O Geil","year":"2000","unstructured":"Geil O., Hoholdt T.: Footprints or generalized Bezout\u2019s theorem. IEEE Trans. Inform. Theory 46(2), 635\u2013641 (2000).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1689_CR13","doi-asserted-by":"crossref","unstructured":"Camps, E., L\u00f3pez, H., Matthews, G., Sarmiento, E.: Monomial-cartesian codes closed under divisibility. In: Proc. 14th Int. Conf. Finite Fields Appl., pp. 199\u2013208 (2020)","DOI":"10.1515\/9783110621730-014"},{"issue":"8","key":"1689_CR14","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s10623-020-00764-5","volume":"88","author":"I Garc\u00eda-Marco","year":"2020","unstructured":"Garc\u00eda-Marco I., M\u00e1rquez-Corbella I., Ruano D.: High dimensional affine codes whose square has a designed minimum distance. Des. Codes Cryptogr. 88(8), 1653\u20131672 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1689_CR15","first-page":"3","volume":"637","author":"H Randriambololona","year":"2015","unstructured":"Randriambololona H.: On products and powers of linear codes under componentwise multiplication. Algorithmic Arith. Geom. Coding Theory 637, 3\u201378 (2015).","journal-title":"Algorithmic Arith. Geom. Coding Theory"},{"key":"1689_CR16","doi-asserted-by":"crossref","unstructured":"Geil, O., H\u00f8holdt, T.: On hyperbolic codes. In: Applied algebra, algebraic algorithms and error-correcting codes: 14th international symposium, AAECC-14 Melbourne, Australia, November 26\u201330, 2001 Proceedings 14. Springer. pp. 159\u2013171 (2001)","DOI":"10.1007\/3-540-45624-4_17"},{"key":"1689_CR17","doi-asserted-by":"crossref","unstructured":"Dutta, S., Cadambe, V., Grover, P.: Coded convolution for parallel and distributed computing within a deadline. In: 2017 IEEE International Symposium on Information Theory (ISIT), IEEE. pp. 2403\u20132407 (2017)","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"1689_CR18","doi-asserted-by":"crossref","unstructured":"Fidalgo-D\u00edaz, A., Mart\u00ednez-Pe\u00f1as, U.: Distributed matrix multiplication over small fields with straggler tolerance. In: 2024 Encuentro de \u00c1lgebra Computacional Y Aplicaciones (EACA). Interdisciplinary Institute of Mathematics of UCM (2024)","DOI":"10.1109\/ISIT57864.2024.10619418"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01689-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01689-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01689-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:03:26Z","timestamp":1760551406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01689-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,18]]},"references-count":18,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1689"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01689-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,7,18]]},"assertion":[{"value":"3 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","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":"Competing interests"}}]}}