{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:37Z","timestamp":1750307377739,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:00:00Z","timestamp":1277683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["90407009"],"award-info":[{"award-number":["90407009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2007AA07Z2A7"],"award-info":[{"award-number":["2007AA07Z2A7"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,28]]},"DOI":"10.1145\/1815396.1815421","type":"proceedings-article","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T13:05:15Z","timestamp":1277816715000},"page":"104-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal MISO secrecy beamforming via quasi-convex programming with rank-one transmit covariance guarantee"],"prefix":"10.1145","author":[{"given":"Ling","family":"Tang","sequence":"first","affiliation":[{"name":"Southeast University, Nanjing, China"}]},{"given":"Hao","family":"Liu","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, China"}]},{"given":"Jianhui","family":"Wu","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2010,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"e_1_3_2_1_3_1","volume-title":"IEEE Int. Symp. Inf Theory (ISIT)","author":"Liang Y.","year":"2007","unstructured":"Y. Liang , H. V. Poor , and S. Shamai (Shitz), \"Secrecy capacity region of fading broadcast channels,\" Proc . IEEE Int. Symp. Inf Theory (ISIT) , June . 2007 . Y. Liang, H. V. Poor, and S. Shamai (Shitz), \"Secrecy capacity region of fading broadcast channels,\" Proc. IEEE Int. Symp. Inf Theory (ISIT), June. 2007."},{"key":"e_1_3_2_1_4_1","volume-title":"IEEE Int. Symp. Inf Theory (ISIT)","author":"Liang Y.","year":"2006","unstructured":"Y. Liang , and H. V. Poor , \" Generalized multiple access channels with confidential messages,\" Proc . IEEE Int. Symp. Inf Theory (ISIT) , Jul. 2006 . Y. Liang, and H. V. Poor, \"Generalized multiple access channels with confidential messages,\" Proc. IEEE Int. Symp. Inf Theory (ISIT), Jul. 2006."},{"key":"e_1_3_2_1_5_1","volume-title":"Annu. Allerton Conf. Commun., Control, and Computing","author":"Tckin E.","year":"2006","unstructured":"E. Tckin and A. Yener , \" Achievable Rates for the General Gaussian Multiple Access Wire-tap Channel with Collective Secrecy,\" in Proc . Annu. Allerton Conf. Commun., Control, and Computing , Monticello , Sep. 2006 . E. Tckin and A. Yener, \"Achievable Rates for the General Gaussian Multiple Access Wire-tap Channel with Collective Secrecy,\" in Proc. Annu. Allerton Conf. Commun., Control, and Computing, Monticello, Sep. 2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921879"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009584"},{"key":"e_1_3_2_1_8_1","volume-title":"Secure transmission with multiple antennas: the misome wiretap channel,\" submitted for publication","author":"Khisti A.","year":"2007","unstructured":"A. Khisti and G. W. Wornell , \" Secure transmission with multiple antennas: the misome wiretap channel,\" submitted for publication , 2007 . {Online} Available at arXiv:0708.4219v1. A. Khisti and G. W. Wornell, \"Secure transmission with multiple antennas: the misome wiretap channel,\" submitted for publication, 2007. {Online} Available at arXiv:0708.4219v1."},{"key":"e_1_3_2_1_9_1","volume-title":"The secrecy capacity of the mimo wiretap channel,\" submitted for publication","author":"Oggier F.","year":"2007","unstructured":"F. Oggier and B. Hassibi , \" The secrecy capacity of the mimo wiretap channel,\" submitted for publication , 2007 . {Online} Available at arXiv:0710.1920v1. F. Oggier and B. Hassibi, \"The secrecy capacity of the mimo wiretap channel,\" submitted for publication, 2007. {Online} Available at arXiv:0710.1920v1."},{"key":"e_1_3_2_1_10_1","unstructured":"T. Liu and S. Shamai (Shitz) \"A note on the secrecy capacity of the multi-antenna wiretap channel \" submitted for publication 2007. {Online} Available at arXiv:0710.4105.  T. Liu and S. Shamai (Shitz) \"A note on the secrecy capacity of the multi-antenna wiretap channel \" submitted for publication 2007. {Online} Available at arXiv:0710.4105."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880064"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. Annu. Allerton Conf. Commun., Control, and Computing","author":"Liang Y.","year":"2001","unstructured":"Y. Liang , G. Kramer , H. V. Poor , and S. Shamai (Shitz), \"Compound wire-tap channels,\" in Proc. Annu. Allerton Conf. Commun., Control, and Computing , Monticello, Illinois, USA , Sep. 2001 . Y. Liang, G. Kramer, H. V. Poor, and S. Shamai (Shitz), \"Compound wire-tap channels,\" in Proc. Annu. Allerton Conf. Commun., Control, and Computing, Monticello, Illinois, USA, Sep. 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"IEEE Int. Symp. Inf Theory (ISIT)","author":"Shafiee S.","year":"2007","unstructured":"S. Shafiee and S. Ulukus , \" Achievable Rates in Gaussian MISO Channels with Secrecy Constraints,\" Proc . IEEE Int. Symp. Inf Theory (ISIT) , June . 2007 . S. Shafiee and S. Ulukus, \"Achievable Rates in Gaussian MISO Channels with Secrecy Constraints,\" Proc. IEEE Int. Symp. Inf Theory (ISIT), June. 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793974.1794195"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080105"}],"event":{"name":"IWCMC '10: 2010 International Wireless Communications and Mobile Computing Conference","sponsor":["Computer and Information Society","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGCOMM ACM Special Interest Group on Data Communication","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Caen France","acronym":"IWCMC '10"},"container-title":["Proceedings of the 6th International Wireless Communications and Mobile Computing Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1815396.1815421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1815396.1815421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:09Z","timestamp":1750245789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1815396.1815421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,28]]},"references-count":16,"alternative-id":["10.1145\/1815396.1815421","10.1145\/1815396"],"URL":"https:\/\/doi.org\/10.1145\/1815396.1815421","relation":{},"subject":[],"published":{"date-parts":[[2010,6,28]]},"assertion":[{"value":"2010-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}