{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:58:28Z","timestamp":1730213908458,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/dasc.2013.140","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T21:07:41Z","timestamp":1406581661000},"page":"642-647","source":"Crossref","is-referenced-by-count":0,"title":["Cost Advantage of Network Coding in Space for Irregular (5 + 1) Model"],"prefix":"10.1109","author":[{"given":"Ting","family":"Wen","sequence":"first","affiliation":[]},{"given":"Xiaoxi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jiaqing","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Network Coding Fundamentals","year":"2007","author":"fragouli","key":"13"},{"journal-title":"Minimum Network about Steiner Tree Problem","year":"2006","author":"yue","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283071"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.3.CO;2-M"},{"key":"6","article-title":"Superiority of network coding in space for irregular polygons","author":"zhang","year":"2012","journal-title":"ICCT"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570816"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283071"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261881"},{"key":"8","first-page":"521","article-title":"Network coding in two-dimensional euclidean space","volume":"24","author":"huang","year":"2012","journal-title":"JOURNAL OF CHONGQING UNIVERSITY OF POST AND TELECOMMUNICATIONS (NATURAL SCIENCE EDITION)"}],"event":{"name":"2013 IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)","start":{"date-parts":[[2013,12,21]]},"location":"Chengdu, China","end":{"date-parts":[[2013,12,22]]}},"container-title":["2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6843220\/6844299\/06844440.pdf?arnumber=6844440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T21:10:25Z","timestamp":1490303425000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6844440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/dasc.2013.140","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}