{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:54Z","timestamp":1740131694651,"version":"3.37.3"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tit.2015.2468216","type":"journal-article","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T11:07:10Z","timestamp":1439550430000},"page":"5525-5534","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Secrecy Capacity of Gaussian Parallel Relay Networks"],"prefix":"10.1109","volume":"61","author":[{"given":"Nicolas","family":"Schrammar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797730"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219154"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref14","first-page":"355","article-title":"Information theoretic security","volume":"4","author":"liang","year":"2009","journal-title":"Found Trends Commun Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2321566"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.3.334"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2011.5779401"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034268"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120070"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110110"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2009.5044926"},{"article-title":"Information-theoretic secrecy for wireless networks","year":"2009","author":"perron","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595090"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866312"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205607"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7258415\/07194817.pdf?arnumber=7194817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:31Z","timestamp":1641987991000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7194817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":18,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2468216","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}