{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T05:03:42Z","timestamp":1780031022467,"version":"3.53.1"},"reference-count":79,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Research Council (ERC)-StG through the Project SENSIBILIT\u00c9","award":["101077361"],"award-info":[{"award-number":["101077361"]}]},{"name":"Huawei France-Funded Chair Toward Future Wireless Networks"},{"name":"Program \u201cPEPR Networks of the Future\u201d of France 2030."}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/jsait.2026.3688105","type":"journal-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:52:19Z","timestamp":1777319539000},"page":"175-191","source":"Crossref","is-referenced-by-count":0,"title":["Structured Polynomial Codes for Distributed Matrix Multiplication"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-6641","authenticated-orcid":false,"given":"Derya","family":"Malak","sequence":"first","affiliation":[{"name":"Communication Systems Department, EURECOM, Sophia Antipolis, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Introduction to Linear Algebra","author":"Strang","year":"2023"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3649596"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2176337"},{"key":"ref5","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref7","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref10","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1201\/b12770"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-013-9255-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3277882"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130406"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref21","first-page":"5152","article-title":"Coded sparse matrix multiplication","volume-title":"Proc., Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619418"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3308768"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112952"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102882"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton58177.2023.10313473"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965839"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107942"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028518"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb01087.x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619604"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2026.3692427"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056560"},{"key":"ref43","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","volume-title":"Proc. 6th Prague Conf. Inf. Theory","author":"K\u00f6rner"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332464"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2011.6033872"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965814"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton58177.2023.10313467"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton63246.2024.10735279"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3279768"},{"key":"ref51","first-page":"94","article-title":"Coding for noisy channels","volume-title":"Proc. IRE WESCON Conv. Rec.","volume":"2","author":"Elias"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2945-6"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174208"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056381"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103852"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1561\/0100000083"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834727"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517963"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2872912"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2782753"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/2.179115"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127910"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3283967"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC60668.2024.10694316"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195361"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620392"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref69","first-page":"2100","article-title":"\u2019Short-dot\u2019: Computing large linear transforms distributedly using coded short dot products","volume-title":"Proc., Adv. Neural Inf. Process. Syst.","volume":"29","author":"Dutta"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3249565"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619604"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056669"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161637"},{"key":"ref75","volume-title":"Lossy Interactive Sum Modulo Two Computation of Binary Sources","author":"Torabi","year":"2016"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852258"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195419"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/11395188\/11495129.pdf?arnumber=11495129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T04:21:44Z","timestamp":1780028504000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11495129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":79,"URL":"https:\/\/doi.org\/10.1109\/jsait.2026.3688105","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}