{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:41:53Z","timestamp":1725529313259},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/itw.2005.1531866","type":"proceedings-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T10:48:27Z","timestamp":1132051707000},"page":"5 pp.","source":"Crossref","is-referenced-by-count":5,"title":["On the capacity of erasure relay channel: multi-relay case"],"prefix":"10.1109","author":[{"given":"R.","family":"Khalili","sequence":"first","affiliation":[]},{"given":"K.","family":"Salamatian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Theory of Error-Correcting Codes","year":"1977","author":"mac williams","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.825846"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2005.3"},{"key":"12","article-title":"Bounds on achievable rates for general multi-terminal networks with practical constraints","author":"khojastepour","year":"2003","journal-title":"LNCS"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csiszar","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90019-1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/IWWAN.2004.1525585"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814480"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365437"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055652"},{"key":"9","article-title":"On the achievability of cut-set bound for a class of erasure relay channels: The non-degraded case","author":"khalili","year":"2004","journal-title":"ISTT"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"}],"event":{"name":"IEEE Information Theory Workshop, 2005.","start":{"date-parts":[[2005,8,29]]},"location":"Rotorua, New Zealand","end":{"date-parts":[[2005,8,29]]}},"container-title":["IEEE Information Theory Workshop, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10256\/32676\/01531866.pdf?arnumber=1531866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:56:41Z","timestamp":1489539401000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1531866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2005.1531866","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}