{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:06:55Z","timestamp":1730232415830,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/icc.2011.5962910","type":"proceedings-article","created":{"date-parts":[[2011,8,4]],"date-time":"2011-08-04T01:44:20Z","timestamp":1312422260000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Max-Flow Protection Using Network Coding"],"prefix":"10.1109","author":[{"given":"Osameh M.","family":"Al-Kofahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed E.","family":"Kamal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"1+n network protection for mesh networks: Network coding-based protection using p-cycles","author":"kamal","year":"0","journal-title":"IEEE\/ACM Trans on Net"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref10"},{"key":"ref6","article-title":"Scalable redundancy for sensors-to-sink communication","author":"ai-kofahi","year":"0","journal-title":"the Proceeding of Globecom 2008"},{"key":"ref11","article-title":"A construction of matrices with no singular square sub-matrices","author":"lacan","year":"2003","journal-title":"proceedings of the 7th International Conference on Finite Fields and Applications"},{"key":"ref5","article-title":"Network coding-based protection of many-to-one wireless flows","volume":"27","author":"ai-kofahi","year":"2009","journal-title":"IEEE JSAC"},{"journal-title":"Max-flow protection using network coding","year":"0","author":"ai-kofahi","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2007.4357606"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2001.992756"},{"key":"ref9","article-title":"Maximum coverage problem with group budget constraints and applications","volume":"3122","author":"chekuri","year":"0","journal-title":"proceedings of APPROX 2004 Lecture Notes in Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916780"}],"event":{"name":"ICC 2011 - 2011 IEEE International Conference on Communications","start":{"date-parts":[[2011,6,5]]},"location":"Kyoto, Japan","end":{"date-parts":[[2011,6,9]]}},"container-title":["2011 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5962386\/5962409\/05962910.pdf?arnumber=5962910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T11:41:56Z","timestamp":1490096516000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5962910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icc.2011.5962910","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}