{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:27:15Z","timestamp":1725665235283},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/acssc.2011.6189981","type":"proceedings-article","created":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T21:16:13Z","timestamp":1335906973000},"page":"183-187","source":"Crossref","is-referenced-by-count":8,"title":["Faster than Nyquist interference assisted secret communication for OFDM systems"],"prefix":"10.1109","author":[{"given":"Arsenia","family":"Chorti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2008.2010812"},{"key":"18","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/978-3-642-03356-8_34","article-title":"On bounded distance decoding, unique shortest vectors, and the minimum distance problem","author":"lyubashevsky","year":"2009","journal-title":"Proc Advances in Cryptology - Crypto 2009"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.21281"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700138"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2011.5990418"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.858337"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/49.730453"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1038\/042013a0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928990"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019505","author":"tulino","year":"2004","journal-title":"Random Matrix Theory and Wireless Communications"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1385-2"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2008.060848"},{"key":"5","first-page":"389","article-title":"The Gaussian wiretap channel with a helping interferer","author":"tang","year":"0","journal-title":"Proc IEEE International Symposium on Information Theory Toronto Canada Jul 2008"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018322"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2010.5671796"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034100"}],"event":{"name":"2011 45th Asilomar Conference on Signals, Systems and Computers","start":{"date-parts":[[2011,11,6]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2011,11,9]]}},"container-title":["2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6185739\/6189941\/06189981.pdf?arnumber=6189981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:10:31Z","timestamp":1594080631000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6189981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/acssc.2011.6189981","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}