{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:20Z","timestamp":1730274560184,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034078","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"2771-2775","source":"Crossref","is-referenced-by-count":1,"title":["Slepian-Wolf type problems on the erasure channel"],"prefix":"10.1109","author":[{"given":"Michael","family":"Luby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Approaching the Slepian-Wolf boundary using practical codes","author":"cabarcas","year":"2004","journal-title":"IEEE International Symposium on Information Theory"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/DCC.2004.1281473"},{"key":"ref10","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2006.871046"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.2005.855584"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ACSSC.2005.1600071"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ISIT.2005.1523573"},{"key":"ref2","article-title":"LDPC codes can approach the Slepian Wolf bound for general binary sources","author":"schonberg","year":"2002","journal-title":"Proceedings of 40th Annual Allerton Conference on Communications Control and Computing"},{"key":"ref9","article-title":"Fountain codes for the Slepian-Wolf problem","author":"ndzana ndzana","year":"2006","journal-title":"Proc of the Allerton Conference on Communications Control and Computing"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.1973.1055037"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034078.pdf?arnumber=6034078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:48:41Z","timestamp":1490068121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034078","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}