{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:38Z","timestamp":1761293618355},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006761","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1411-1415","source":"Crossref","is-referenced-by-count":7,"title":["Cooperative data exchange based on MDS codes"],"prefix":"10.1109","author":[{"given":"Su","family":"Li","sequence":"first","affiliation":[]},{"given":"Michael","family":"Gastpar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447045"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"journal-title":"Universal multiparty data exchange and secret key agreement","year":"2016","author":"tyagi","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570836"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"journal-title":"Randomized Algorithms","year":"2010","author":"motwani","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"journal-title":"Deterministic Network Coding by Matrix Completion","year":"2005","author":"harvey","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523980"},{"key":"ref3","first-page":"282","article-title":"Deterministic algorithm for coded cooperative data exchange","author":"sprintson","year":"2010","journal-title":"International Conference on Heterogeneous Networking for Quality Reliability Security and Robustness"},{"journal-title":"Commu-nication for Omniscience","year":"2016","author":"ding","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541714"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457443"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006761.pdf?arnumber=8006761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T04:24:53Z","timestamp":1504067093000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006761","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}