{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T18:27:56Z","timestamp":1766773676823,"version":"3.48.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Swedish Foundation for Strategic Research under the SUCCESS project","award":["(FUS21-0026)"],"award-info":[{"award-number":["(FUS21-0026)"]}]},{"DOI":"10.13039\/501100009047","name":"Swedish Research Council under Project \u201cCoding for Large-scale Distributed Machine Learning\u201d","doi-asserted-by":"publisher","award":["(No. 2021-04772)"],"award-info":[{"award-number":["(No. 2021-04772)"]}],"id":[{"id":"10.13039\/501100009047","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2024-06464"],"award-info":[{"award-number":["2024-06464"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tcomm.2025.3612589","type":"journal-article","created":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T17:44:06Z","timestamp":1758563046000},"page":"13087-13102","source":"Crossref","is-referenced-by-count":0,"title":["Cooperative Gradient Coding"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0930-7001","authenticated-orcid":false,"given":"Shudi","family":"Weng","sequence":"first","affiliation":[{"name":"Division of Information Science and Engineering, School of Electrical Engineering and Computer Science (EECS), KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9096-8792","authenticated-orcid":false,"given":"Chao","family":"Ren","sequence":"additional","affiliation":[{"name":"Division of Information Science and Engineering, School of Electrical Engineering and Computer Science (EECS), KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5407-0835","authenticated-orcid":false,"given":"Ming","family":"Xiao","sequence":"additional","affiliation":[{"name":"Division of Information Science and Engineering, School of Electrical Engineering and Computer Science (EECS), KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7926-5081","authenticated-orcid":false,"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[{"name":"Division of Information Science and Engineering, School of Electrical Engineering and Computer Science (EECS), KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118346"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2025.3552524"},{"key":"ref3","first-page":"3636","article-title":"Efficient distributed learning with sparsity","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Wang"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3198176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3311824"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3126081"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2022.3196009"},{"key":"ref8","first-page":"1","article-title":"ColRel: Collaborative relaying for federated learning over intermittently connected networks","volume-title":"Proc. Workshop Federated Learning: Recent Adv. New Challenges (Conjunct NeurIPS)","author":"Saha"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3342095"},{"key":"ref10","first-page":"7202","article-title":"Distributed learning over unreliable networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref11","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102853"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00062"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3063180"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3085676"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3418901"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195435"},{"key":"ref18","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ye"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174120"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3122873"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3244243"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/globecom52923.2024.10901785"},{"key":"ref23","first-page":"7611","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Wang"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/globecom52923.2024.10901785"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref26","article-title":"Secure cooperative gradient coding: Optimality, reliability, and global privacy","author":"Weng","year":"2025","journal-title":"arXiv:2507.07565"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2021.3087350"},{"key":"ref28","article-title":"Minimax optimal quantization of linear models: Information-theoretic limits and efficient algorithms","author":"Saha","year":"2022","journal-title":"arXiv:2202.11277"},{"key":"ref29","article-title":"Gradient coding","author":"Tandon","year":"2017","journal-title":"arXiv:1612.03301"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2024.3518057"},{"key":"ref31","article-title":"Heterogeneity-aware client sampling: A unified solution for consistent federated learning","author":"Weng","year":"2025","journal-title":"arXiv:2505.11304"},{"key":"ref32","article-title":"On the convergence of FedAvg on non-IID data","author":"Li","year":"2019","journal-title":"arXiv:1907.02189"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11314911\/11175173.pdf?arnumber=11175173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T18:24:01Z","timestamp":1766773441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11175173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":32,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2025.3612589","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}