{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:30:21Z","timestamp":1729675821461,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875278","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"2469-2473","source":"Crossref","is-referenced-by-count":0,"title":["Achievability bounds for rate-compatible codes"],"prefix":"10.1109","author":[{"given":"Tsung-Yi","family":"Chen","sequence":"first","affiliation":[]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[]},{"given":"Richard D.","family":"Wesel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/ITA.2008.4601087"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/TIT.2010.2043769"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/TIT.2008.2011443"},{"year":"2014","author":"chen","journal-title":"Protographbased Raptor-like LDPC Codes","key":"3"},{"key":"2","article-title":"Rate-compatible low density parity check codes for capacity-approaching ARQ schemes in packet data communications","author":"li","year":"2002","journal-title":"Proc Int Conf on Comm Internet and Info Tech (CIIT)"},{"year":"2013","author":"chen","journal-title":"Feedback Communication Systems with Limitations on Incremental Redundancy","key":"1"},{"key":"10","doi-asserted-by":"crossref","first-page":"4947","DOI":"10.1109\/TIT.2009.2030478","article-title":"Information spectrum approach to second-order coding rate in channel coding","volume":"55","author":"hayashi","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1090\/qam\/113744","article-title":"On the strong converse of the coding theorem for symmetric channels without memory","author":"weiss","year":"1960","journal-title":"Quart Appl Math"},{"year":"1968","author":"gallager","journal-title":"Information Theory and Reliable Communication","key":"6"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1954.1057459","article-title":"A new basic theorem of information theory","volume":"4","author":"feinstein","year":"1954","journal-title":"Information Theory Transactions of the IRE Professional Group on"},{"key":"9","first-page":"689","article-title":"Asymptotische abschatzungen in shannon's informationstheorie","author":"strassen","year":"1962","journal-title":"Trans 3d Prague Conf Inf Theory"},{"key":"8","first-page":"211","article-title":"Mathematical problems in the shannon theory of optimal coding of information","volume":"1","author":"dobrushin","year":"1961","journal-title":"Proc 4th Berkeley Symp Mathematics Statistics and Probability"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875278.pdf?arnumber=6875278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:20:45Z","timestamp":1602674445000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875278","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}