{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:27Z","timestamp":1773377787537,"version":"3.50.1"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517824","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1718-1723","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotic Analysis of Factored LT Codes for Distributed Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Asit Kumar","family":"Pradhan","sequence":"first","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering,College Station,TX,USA,77843"}]},{"given":"Anoosheh","family":"Heidarzadeh","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering,College Station,TX,USA,77843"}]},{"given":"Krishna R.","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering,College Station,TX,USA,77843"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Random convolutional coding for robust and straggler resilient distributed matrix computation","volume":"abs 1907 8064","author":"das","year":"2019","journal-title":"CoRR"},{"key":"ref38","article-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings","volume":"abs 1910 6515","author":"ramamoorthy","year":"2019","journal-title":"CoRR"},{"key":"ref33","author":"pradhan","year":"2019","journal-title":"Factored LT and factored Raptor codes for large-scale distributed matrix multiplication"},{"key":"ref32","author":"subramaniam","year":"2019","journal-title":"Collab-orative decoding of polynomial codes for distributed computation"},{"key":"ref31","author":"das","year":"2019","journal-title":"Random convolutional coding for robust and straggler resilient distributed matrix computation"},{"key":"ref30","author":"ramamoorthy","year":"2019","journal-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682347"},{"key":"ref34","author":"gupta","year":"2019","journal-title":"OverSketched Newton Fast convex optimization for serverless systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278011"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref12","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"0","journal-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref15","author":"maity","year":"2018","journal-title":"Robust gradient descent via moment encoding with ldpc codes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref17","author":"ye","year":"2018","journal-title":"Communication-computation efficient gradient coding"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647133"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref4","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"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"0","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems ser NIPS'17"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996730"},{"key":"ref8","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2017","journal-title":"ICML"},{"key":"ref7","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869092"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.33"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref45","article-title":"The concentration of measure phenomenon","volume":"89","author":"ledoux","year":"2001","journal-title":"AMS Surveys and Monographs"},{"key":"ref22","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"0","journal-title":"Proceedings of the 35th International Conference on Machine Learning"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174314"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref41","article-title":"Coded sparse matrix multiplication","volume":"abs 1802 3430","author":"wang","year":"2018","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2880213"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref25","first-page":"140","article-title":"CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning","volume":"2019","author":"so","year":"2019","journal-title":"IACR Cryptology ePrint Archive"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517824.pdf?arnumber=9517824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:09Z","timestamp":1773347709000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517824","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}