{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:05:24Z","timestamp":1775279124654,"version":"3.50.1"},"reference-count":41,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tcomm.2026.3677353","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:55:50Z","timestamp":1774468550000},"page":"6643-6656","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Cost Encoding for Coded Distributed Computing Systems"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7960-0054","authenticated-orcid":false,"given":"Mahyar","family":"Karami","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5997-1093","authenticated-orcid":false,"given":"Masoud","family":"Ardakani","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0740-1986","authenticated-orcid":false,"given":"Hamid","family":"Ebrahimzad","sequence":"additional","affiliation":[{"name":"Synopsys, Inc, Ottawa, ON, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1869-0970","authenticated-orcid":false,"given":"Zhuhong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Canada Company Ltd., Ottawa, ON, Canada"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3091684"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457566"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref4","article-title":"An adaptive placement and parallelism framework for accelerating RLHF training","author":"Xiao","year":"2023","journal-title":"arXiv:2312.11819"},{"key":"ref5","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Li"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","article-title":"Gradient coding","author":"Tandon","year":"2016","journal-title":"arXiv:1612.03301"},{"key":"ref8","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Yu"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394214"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965760"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3310931"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3322174"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref14","first-page":"61","article-title":"Availability in globally distributed storage systems","volume-title":"Proc. 9th USENIX Symp. Operating Syst. Design Implement. (OSDI)","author":"Ford"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2712186"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref21","article-title":"Efficient training of large language models on distributed infrastructures: A survey","author":"Duan","year":"2024","journal-title":"arXiv:2407.20018"},{"key":"ref22","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","volume-title":"Proc. 10th USENIX Symp. Networked Syst. Design Implement. (NSDI)","author":"Ananthanarayanan"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2506161"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2592042"},{"key":"ref25","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. NIPS","author":"Brown"},{"key":"ref26","article-title":"The era of 1-bit LLMs: All large language models are in 1.58 bits","author":"Ma","year":"2024","journal-title":"arXiv:2402.17764"},{"key":"ref27","first-page":"15","article-title":"Erasure coding in windows Azure storage","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC)","author":"Huang"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"ref29","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dai"},{"key":"ref30","first-page":"9367","article-title":"Reinforcement learning for integer programming: Learning to cut","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tang"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1345"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446100"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1063\/1.4822863"},{"key":"ref35","first-page":"20","article-title":"A 21\/16-approximation for the minimum 3-path partition problem","volume-title":"Proc. 30th Int. Symp. Algorithms Comput. (ISAAC)","author":"Chen"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475"},{"key":"ref37","volume-title":"Gurobi Optimizer Reference Manual","year":"2025"},{"issue":"4","key":"ref38","first-page":"581","article-title":"SCIP: Solving constraint integer programs","volume":"10","author":"Gleixner","year":"2018","journal-title":"Math. Program. Comput."},{"key":"ref39","volume-title":"ILOG CPLEX Optimization Studio User\u2019s Manual","year":"2009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1090\/s0002-9904-1958-10224-4"},{"key":"ref41","article-title":"A RM-polar codes","author":"Li","year":"2014","journal-title":"arXiv:1407.5483"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11320979\/11456088.pdf?arnumber=11456088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:23:05Z","timestamp":1775276585000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11456088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2026.3677353","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.177273593.36403581\/v1","asserted-by":"object"}]},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}