{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:01:12Z","timestamp":1761742872128,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523763","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"2325-2329","source":"Crossref","is-referenced-by-count":41,"title":["On the user selection for MIMO broadcast channels"],"prefix":"10.1109","author":[{"given":"A.","family":"Bayesteh","sequence":"first","affiliation":[]},{"given":"A.K.","family":"Khandani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Optimality of zero-forcing beamforming with multiuser diversity","author":"yoo","year":"0","journal-title":"ICC 2005"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813523"},{"key":"18","article-title":"A vector-perturbation technique for near-capacity multiple-antenna multi-user communications-part i: Channel inversion and regularizetion","author":"peel","year":"0","journal-title":"IEEE Trans on Inform Theory"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/97.329842"},{"key":"16","article-title":"Space-time multiple access: Linear growth in the sum rate","author":"hochwald","year":"2002","journal-title":"40th Annual Allerton Conf Communications Control and Computing"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.815652"},{"key":"14","article-title":"An efficient algorithm for user selection and signalling over mimo multiuser systems","volume":"uw ece 2004 19","author":"maddah-ali","year":"2004","journal-title":"Technical Report"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525188"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003822"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817421"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1292058"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100604"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523763"},{"key":"10","article-title":"On preceding for channels with known interference at the transmitter","author":"farmanbar","year":"2005","journal-title":"Proc Conference on Information Sciences and Systems"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365211"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833336"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814483"},{"key":"9","article-title":"Approaching the dirty paper limit for canceling known interference","author":"erez","year":"2003","journal-title":"41st Annual Allerton Conference on Communication Control and Computing"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856935"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523763.pdf?arnumber=1523763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T01:43:33Z","timestamp":1489628613000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523763\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523763","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}