{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T12:09:10Z","timestamp":1709294950676},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"ONR"},{"name":"NSF","award":["CCF-1161418","CCF-1317351","CCF-1319104"],"award-info":[{"award-number":["CCF-1161418","CCF-1317351","CCF-1319104"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/lcomm.2015.2435733","type":"journal-article","created":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T18:41:06Z","timestamp":1432147266000},"page":"1287-1290","source":"Crossref","is-referenced-by-count":14,"title":["Secure GDoF of <inline-formula> <tex-math notation=\"LaTeX\">$K$<\/tex-math><\/inline-formula>-User Gaussian Interference Channels: When Secrecy Incurs No Penalty"],"prefix":"10.1109","volume":"19","author":[{"given":"Chunhua","family":"Geng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On the optimality of treating interference as noise: A combinatorial optimization perspective","author":"yi","year":"2015","journal-title":"e-print Arxiv 1504 00041"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2432751"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119650"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009807"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021380"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009793"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2132430"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006447"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408342"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2411260"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921879"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921680"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055917"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref9","article-title":"On the optimality of treating interference as noise: Compound interference networks","author":"geng","year":"2014","journal-title":"e-print Arxiv 1412 2711"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7182819\/07110538.pdf?arnumber=7110538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:23Z","timestamp":1642006343000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7110538\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":15,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2015.2435733","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}