{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:10:38Z","timestamp":1784268638698,"version":"3.55.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CCF-2122400"],"award-info":[{"award-number":["CCF-2122400"]}]},{"DOI":"10.13039\/501100006143","name":"Department of Science and Technology, Government of India","doi-asserted-by":"publisher","award":["DST\/INT\/RUS\/RSF\/P-41\/2021"],"award-info":[{"award-number":["DST\/INT\/RUS\/RSF\/P-41\/2021"]}],"id":[{"id":"10.13039\/501100006143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tit.2026.3681406","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:55:37Z","timestamp":1775505337000},"page":"5525-5542","source":"Crossref","is-referenced-by-count":0,"title":["On the Service Rate Region of Reed--Muller Codes"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5626-9564","authenticated-orcid":false,"given":"Hoang","family":"Ly","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7464-4242","authenticated-orcid":false,"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2874-8910","authenticated-orcid":false,"given":"V.","family":"Lalitha","sequence":"additional","affiliation":[{"name":"Signal Processing and Communications Research Center, IIIT Hyderabad, Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Modeling the edge: Peer-to-peer reincarnated","volume-title":"Proc. 2nd USENIX Workshop Hot Topics Edge Comput.","author":"Yadgar"},{"key":"ref2","article-title":"Benchmarking in the dark: On the absence of comprehensive edge datasets","volume-title":"Proc. 3rd USENIX Workshop Hot Topics Edge Comput.","author":"Kolosov"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3117695"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/0100000115"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174345"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2026.3709105"},{"key":"ref7","article-title":"Maximal achievable service rates of codes and connections to combinatorial designs","volume-title":"Proc. 61th Annu. Allerton Conf. Commun., Control, Comput.","author":"Ly"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174027"},{"key":"ref9","article-title":"Optimum 1-step majority-logic decoding of binary Reed\u2013Muller codes","author":"Ly","year":"2025","journal-title":"arXiv:2508.08736"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3054385"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3708994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2026.3662151"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/23M1557829"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3286452"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref21","volume-title":"Final Report of 3GPP TSG RAN WG1 #87 V1.0.0","year":"2026"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2043161"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3592631"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-025-01749-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.817523"},{"key":"ref27","article-title":"Majority-logic decoding of binary locally recoverable codes: A probabilistic analysis","author":"Ly","year":"2026","journal-title":"arXiv:2601.08765"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3095968"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.02.004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195676"},{"key":"ref32","volume-title":"Understanding and Using Linear Programming (Universitext)","author":"Matouek","year":"2006"},{"key":"ref33","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3"},{"key":"ref35","volume-title":"Error-Correcting Codes","author":"Peterson","year":"1972"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-009-0014-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1142\/s0219498825410051"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IPCCC59175.2023.10253868"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282699"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3067054"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437518"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11611849\/11475543-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11611849\/11475543.pdf?arnumber=11475543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T05:55:17Z","timestamp":1784267717000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11475543\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3681406","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}