{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:03:47Z","timestamp":1761663827382,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSERC Discovery Accelerator Supplement"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tcomm.2018.2879088","type":"journal-article","created":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T01:41:36Z","timestamp":1541468496000},"page":"943-954","source":"Crossref","is-referenced-by-count":12,"title":["Systematic Fountain Codes for Massive Storage Using the Truncated Poisson Distribution"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0227-8052","authenticated-orcid":false,"given":"Toritseju","family":"Okpotse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahram","family":"Yousefi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Notes on reliability models for non-MDS erasure codes","year":"2006","author":"lee hafner","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586202"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.091112.110864"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/3001439"},{"journal-title":"Discrete Mathematics and Its Applications","year":"2007","author":"rosen","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2681878"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2539160"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"article-title":"Coding and scheduling in networks for erasures and broadcast","year":"2011","author":"gummadi","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140522"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2008.48"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASID.2012.6325333"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2013.6621610"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127415500728"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2017.1352"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref6","first-page":"2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc Annu Conf USENIX Ann Tech Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.040913.130136"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2581163"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2332491"},{"year":"2013","key":"ref2","article-title":"A focus on efficiency"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/285243.285258","article-title":"A digital fountain approach to reliable distribution of bulk data","author":"byers","year":"1998","journal-title":"Proc ACM SIGCOMM Conf Appl Technol Archit Protocols Comput Commun"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2015.7255143"},{"journal-title":"Channel Codes Classical and Modern","year":"2009","author":"william","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.091911.100189"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8642462\/08519783.pdf?arnumber=8519783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:41:14Z","timestamp":1657744874000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8519783\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2879088","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}