{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:45:13Z","timestamp":1730285113009,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/netcod.2012.6261892","type":"proceedings-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T16:06:13Z","timestamp":1345133173000},"page":"103-107","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic network coding algorithms and applications for wireless networks"],"prefix":"10.1109","author":[{"given":"Zoltan","family":"Kiraly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erika Renata","family":"Kovacs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503221"},{"key":"ref11","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"SODA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050934"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.080564"},{"key":"ref16","article-title":"Optimality of network coding in packet networks","volume":"abs 1102 3569","author":"haeupler","year":"2011","journal-title":"CoRR"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.901080"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.61"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.97"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394810"},{"key":"ref5","article-title":"Fast algorithm for finding unicast capacity of linear deterministic wireless relay networks","volume":"abs 909 5507","author":"shi","year":"2009","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707093"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"journal-title":"Proceedings of the 45th annual Allerton conference on Communication control and computing ser Allerton’ 07","article-title":"Wireless network information flow","year":"2007","key":"ref2"},{"key":"ref1","article-title":"A deterministic approach to wireless relay networks","author":"avestimehr","year":"2007","journal-title":"Proceedings of the 45th annual Allerton conference on Communication control and computing ser Allerton’ 07"},{"key":"ref9","first-page":"1","article-title":"A deterministic polynomial time algorithm for constructing a multicast coding scheme for linear deterministic relay networks","author":"yazdi","year":"2011","journal-title":"IEEE"}],"event":{"name":"2012 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2012,6,29]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,6,30]]}},"container-title":["2012 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6253017\/6261874\/06261892.pdf?arnumber=6261892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:46:48Z","timestamp":1490114808000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6261892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/netcod.2012.6261892","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}