{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T21:23:19Z","timestamp":1772140999083,"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"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471317"],"award-info":[{"award-number":["12471317"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371524"],"award-info":[{"award-number":["12371524"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62331002"],"award-info":[{"award-number":["62331002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["W2531009"],"award-info":[{"award-number":["W2531009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tcomm.2026.3663512","type":"journal-article","created":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T21:04:53Z","timestamp":1770757493000},"page":"4680-4693","source":"Crossref","is-referenced-by-count":0,"title":["New Lower Bounds on File Size of Fractional Repetition Codes via Eigenvalues of Bipartite Graphs"],"prefix":"10.1109","volume":"74","author":[{"given":"Xin","family":"Ling","sequence":"first","affiliation":[{"name":"School of Mathematics, Southwest Jiaotong University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8467-9871","authenticated-orcid":false,"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Mathematics, Southwest Jiaotong University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Mathematical Science, Sichuan Normal University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5237-1001","authenticated-orcid":false,"given":"Rong","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Mathematics, Southwest Jiaotong University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref3","article-title":"Distributed data storage with minimum storage regenerating codes-exact and functional repair are asymptotically equally efficient","author":"Cadambe","year":"2010","journal-title":"arXiv:1004.4299"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023110"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2941744"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2442231"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2531720"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483351"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876284"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834575"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01370-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2799213"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277958"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929788"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3128543"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3529680"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.030114.132694"},{"key":"ref20","article-title":"On weak dress codes for cloud storage","author":"Gupta","year":"2013","journal-title":"arXiv:1302.3681"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-020-01414-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140523"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS48256.2020.9027326"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6"},{"issue":"1","key":"ref25","first-page":"51","article-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators","volume":"24","author":"Margulis","year":"1988","journal-title":"Probl. Peredachi Inf."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1054"},{"key":"ref27","volume":"207","author":"Godsil","year":"2013","journal-title":"Algebraic Graph Theory"},{"key":"ref28","volume-title":"Essential Coding Theory","author":"Guruswami","year":"2018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.37236\/2831"},{"key":"ref30","first-page":"1","article-title":"Eigenvalue techniques in design and graph theory","volume":"121","author":"Haemers","year":"1979","journal-title":"Math. Comput. Sci."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(95)00199-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10711-005-0549-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1990-15918-X"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1201\/9781003040897"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17987-2_1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11139-021-00384-0"},{"key":"ref37","article-title":"Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees","author":"Gribinski","year":"2021","journal-title":"arXiv:2108.02534"},{"key":"ref38","first-page":"164","article-title":"Graph-based construction for non-malleable codes","volume":"2021","author":"Satake","year":"2021","journal-title":"Cryptol. ePrint Arch."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00058-L"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120326"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3390\/e26040348"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11320979\/11389854.pdf?arnumber=11389854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:44:24Z","timestamp":1772138664000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11389854\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2026.3663512","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}