{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:30:27Z","timestamp":1729672227496,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282828","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"2111-2115","source":"Crossref","is-referenced-by-count":7,"title":["Channel resolvability codes based on concatenation and sparse linear encoding"],"prefix":"10.1109","author":[{"given":"Rana Ali","family":"Amjad","sequence":"first","affiliation":[]},{"given":"Gerhard","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970875"},{"journal-title":"Concatenated Codes","year":"1966","author":"forney","key":"ref11"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513794"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1561\/0100000028","article-title":"Topics in multi-user information theory","volume":"4","author":"kramer","year":"2007","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054651"},{"key":"ref6","article-title":"Semantically-secure coding scheme achieving the capacity of a Gaussian wiretap channel","author":"tyagi","year":"2014","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2013.6621596"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483268"},{"key":"ref7","article-title":"Optimal quantization for distribution synthesis","author":"b\u00f6cherer","year":"2013","journal-title":"ArXiv Preprint"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483321"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282828.pdf?arnumber=7282828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T03:23:57Z","timestamp":1599621837000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282828","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}