{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:03Z","timestamp":1773377463644,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849625","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"827-831","source":"Crossref","is-referenced-by-count":12,"title":["Attributes of Generators for Best Finite Blocklength Coset Wiretap Codes over Erasure Channels"],"prefix":"10.1109","author":[{"given":"Willie K.","family":"Harrison","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, 84602"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu R.","family":"Bloch","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, 30332"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GIIS.2013.6684342"},{"key":"ref12","article-title":"Secure coding schemes and code design for the wiretap channel","author":"zhang","year":"2014","journal-title":"Ph D Dissertation"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59265-7_4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996925"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635841"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977985"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2015.7414188"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2892010"},{"key":"ref19","author":"diestel","year":"2006","journal-title":"Graduate Texts in Mathematics Graph Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901143"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541867"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2265141"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162275"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2463678"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849625.pdf?arnumber=8849625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:52Z","timestamp":1773347632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849625","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}