{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T16:44:36Z","timestamp":1789836276564,"version":"4.0.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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":[[2010,7]]},"DOI":"10.1109\/tit.2010.2048497","type":"journal-article","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T15:03:57Z","timestamp":1277305437000},"page":"3105-3114","source":"Crossref","is-referenced-by-count":19,"title":["Rateless Codes for AVC Models"],"prefix":"10.1109","volume":"56","author":[{"given":"Anand D.","family":"Sarwate","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Gastpar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828152"},{"key":"ref31","article-title":"rateless coding for non-ergodic channels with decoder channel state information","author":"draper","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref30","article-title":"coding into a source: a direct inverse rate-distortion theorem","author":"agarwal","year":"2006","journal-title":"Proc 45th Ann Allerton Conf Commun Contr Computat"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of <formula formulatype=\"inline\"><tex Notation=\"TeX\">$r$<\/tex><\/formula> others","volume":"51","author":"erds","year":"1985","journal-title":"Israel J Math"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872974"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"4372","DOI":"10.1109\/TIT.2007.907495","article-title":"Fountain capacity","volume":"53","author":"(shitz)","year":"2007","journal-title":"IEEE Trans Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034779"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(62)90203-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00534915"},{"key":"ref16","first-page":"10","article-title":"a method of coding and an application to arbitrarily varying channels","volume":"5","author":"ahlswede","year":"1980","journal-title":"J Combinator Inf Syst Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533715"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696979"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057288"},{"key":"ref28","author":"csiszr","year":"1982","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535895"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/3212384"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"ref29","article-title":"scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes","author":"smith","year":"2007","journal-title":"Proc 2007 ACM-SIAM Symp Discrete Algorithms (SODA 2007)"},{"key":"ref5","author":"sarwate","year":"2008","journal-title":"Robust and adaptive communication under uncertain interference"},{"key":"ref8","first-page":"1290","article-title":"fountain codes","author":"shokrollahi","year":"2003","journal-title":"Proc 41st Allerton Conf Commun Control Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313104"},{"key":"ref9","author":"shulman","year":"2003","journal-title":"Communication over an Unknown Channel via Common Broadcasting"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557354"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.61125"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.481780"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1056995"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.79922"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5484964\/05485014.pdf?arnumber=5485014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:52Z","timestamp":1633913032000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5485014\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":35,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2048497","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}