{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T05:54:19Z","timestamp":1792475659901,"version":"4.5.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,9]]},"DOI":"10.1109\/icc51166.2024.10622502","type":"proceedings-article","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T15:34:42Z","timestamp":1724168082000},"page":"1998-2003","source":"Crossref","is-referenced-by-count":1,"title":["Sequence-aware Coding for Matrix Multiplication with Arbitrary Recoverability"],"prefix":"10.1109","author":[{"given":"Yuchun","family":"Zou","sequence":"first","affiliation":[{"name":"Graduate Center, City University of New York,New York,NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Queens College & Graduate Center, City University of New York,New York,NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IT-DREPS.2017.8277807"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41377-022-00717-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3422-8_39"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/166237.166265"},{"key":"ref7","first-page":"3368","article-title":"Gradient Coding: Avoiding Stragglers in Distributed Learning","volume-title":"International Conference on Machine Learning","author":"Tandon","year":"2017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2506161"},{"key":"ref9","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","volume-title":"10th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Ananthanarayanan"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2496593"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592042"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2622248"},{"key":"ref13","article-title":"Distributed Matrix Multiplication Using Speed Adaptive Coding","author":"Narra","year":"2019","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2017.0-166"},{"key":"ref15","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"Yu","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref17","first-page":"5937","article-title":"Dual entangled polynomial code: Three-dimensional coding for distributed matrix multiplication","volume-title":"International Conference on Machine Learning","author":"Soto","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS49365.2020.9213028"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref23","article-title":"Polynomially coded regression: Optimal straggler mitigation via data encoding","author":"Li","year":"2018","journal-title":"arXiv preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2019.8929896"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9014006"},{"key":"ref28","article-title":"Optimal load allocation for coded distributed computation in heterogeneous clusters","author":"Kim","year":"2019","journal-title":"arXiv preprint"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356170"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849212"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155226"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279320"}],"event":{"name":"ICC 2024 - IEEE International Conference on Communications","location":"Denver, CO, USA","start":{"date-parts":[[2024,6,9]]},"end":{"date-parts":[[2024,6,13]]}},"container-title":["ICC 2024 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10622104\/10622158\/10622502.pdf?arnumber=10622502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T20:14:43Z","timestamp":1724962483000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10622502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/icc51166.2024.10622502","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]}}}