{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:52:27Z","timestamp":1784303547352,"version":"3.55.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF-2122400"],"award-info":[{"award-number":["CIF-2122400"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/tit.2026.3662151","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:48:05Z","timestamp":1770410885000},"page":"2144-2161","source":"Crossref","is-referenced-by-count":1,"title":["Service Rate Regions of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs"],"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":"Rutgers, The State University of New Jersey, 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":"Rutgers, The State University of New Jersey, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000115"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282699"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3067054"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3078505.3078553"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437518"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3117695"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262713"},{"key":"ref8","article-title":"The service rate region of Hamming codes","author":"Choudhary","year":"2025","journal-title":"arXiv:2509.22898"},{"key":"ref9","article-title":"Maximal achievable service rates of codes and connections to combinatorial designs","volume-title":"Proc. 61st Annu. Allerton Conf. Commun., Control, Comput.","author":"Ly"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174027"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195676"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195676"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/23M1557829"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619288"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3095968"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.02.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.833807"},{"key":"ref19","article-title":"Optimum 1-step majority-logic decoding of binary Reed\u2013M\u00fcller codes","author":"Ly","year":"2025","journal-title":"arXiv:2508.08736"},{"key":"ref20","article-title":"Majority-logic decoding of binary locally recoverable codes: A probabilistic analysis","author":"Ly","year":"2026","journal-title":"arXiv:2601.08765"},{"key":"ref21","article-title":"The oval strikes back","author":"Di Giusto","year":"2026","journal-title":"arXiv:2601.16628"},{"key":"ref22","volume-title":"Understanding and Using Linear Programming","author":"Matouek","year":"2006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834616"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11448285\/11373612-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11448285\/11373612.pdf?arnumber=11373612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:57:42Z","timestamp":1774036662000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11373612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":24,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3662151","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}