{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:54:21Z","timestamp":1763808861157},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/tit.2009.2025577","type":"journal-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:00:35Z","timestamp":1251126035000},"page":"4119-4133","source":"Crossref","is-referenced-by-count":14,"title":["Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information"],"prefix":"10.1109","volume":"55","author":[{"given":"Stark C.","family":"Draper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Frey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057222"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872974"},{"key":"ref11","first-page":"1332","article-title":"universal incremental slepian-wolf coding","author":"draper","year":"2004","journal-title":"Proc 42nd Allerton Conf Communication Control and Computing"},{"key":"ref12","first-page":"3","article-title":"shannon's theorems for a complete class of discrete channels whose state is known at the output","volume":"11","author":"stambler","year":"1975","journal-title":"Probl Pered Inform"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.930931"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871615"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899543"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.831721"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/26.848555"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523487"},{"key":"ref28","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365076"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557423"},{"key":"ref3","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"},{"key":"ref6","first-page":"933","article-title":"faster-than-nyquist coding: the merits of a regime change","author":"erez","year":"2004","journal-title":"Proc 42nd Allerton Conf Communication Control and Computing"},{"key":"ref29","first-page":"19","article-title":"coding for channels with random parameters","volume":"9","author":"gel'fand","year":"1980","journal-title":"Probl Contr Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365075"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365416"},{"key":"ref7","author":"shulman","year":"2003","journal-title":"Communication over an Unknown Channel via Common Broadcasting"},{"key":"ref2","first-page":"1290","article-title":"fountain codes","author":"shokrollahi","year":"2003","journal-title":"Proc 41st Allerton Conf Communication Control and Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365415"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054129"},{"key":"ref22","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"},{"key":"ref24","first-page":"10","article-title":"data transmission over a discrete channel with feedback. random transmission time","volume":"12","author":"burnashev","year":"1976","journal-title":"Probl Pered Inform"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023634"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523597"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5208468\/05208532.pdf?arnumber=5208532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:09Z","timestamp":1633910349000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5208532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":30,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2025577","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}