{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:03Z","timestamp":1773377763395,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834469","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2619-2624","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes"],"prefix":"10.1109","author":[{"given":"Wenjing","family":"Chen","sequence":"first","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2021.3123197"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282817"},{"key":"ref32","article-title":"Outer bounds for exact repair codes","author":"duursma","year":"2014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875270"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282577"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517792"},{"key":"ref36","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408595"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079498"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref12","article-title":"A note on the rate region of exact-repair regenerating codes","author":"tian","year":"2015"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e20080603"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3038392"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2576467"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628791"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437874"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3015818"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053217"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/0100000007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2840995"},{"key":"ref5","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174262"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/info12020082"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2757474"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2701807"},{"key":"ref25","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834469.pdf?arnumber=9834469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:05Z","timestamp":1773347705000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834469\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834469","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}