{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:43Z","timestamp":1740133063194,"version":"3.37.3"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/lcomm.2020.2969349","type":"journal-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T21:35:26Z","timestamp":1579901726000},"page":"725-728","source":"Crossref","is-referenced-by-count":4,"title":["An Analytical Model for the Partial Intercept Probability in Sparse Linear Network Coding"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6262-4834","authenticated-orcid":false,"given":"Hadi","family":"Sehat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5918-7250","authenticated-orcid":false,"given":"Peyman","family":"Pahlevani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2840139"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2907290"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2896626"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.060513.130684"},{"key":"ref11","first-page":"145","author":"pedersen","year":"2011","journal-title":"KODO An Open and Research Oriented Network Coding Library"},{"key":"ref5","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc NetCod"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977985"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.062113.130478"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2470662"},{"key":"ref9","article-title":"On the probability of partial decoding in sparse network coding","author":"sehat","year":"2019","journal-title":"arXiv 1907 12051"},{"key":"ref1","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9062391\/08968583.pdf?arnumber=8968583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:49:54Z","timestamp":1651074594000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8968583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":11,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.2969349","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}