{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:20:58Z","timestamp":1729664458658,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218531","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T21:33:36Z","timestamp":1440452016000},"page":"1526-1534","source":"Crossref","is-referenced-by-count":0,"title":["Flow-based feasibility test of linear interference alignment with arbitrary interference topology"],"prefix":"10.1109","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Al-Dhelaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133957"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2161297"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000047","article-title":"Interference alignment: A new look at signal dimensions in a communication network","volume":"7","author":"jafar","year":"2011","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911262"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425352"},{"key":"ref15","article-title":"On the complexity of leakage interference minimization for interference alignment","author":"liu","year":"2010","journal-title":"Proc IEEE Int'l Workshop on Signal Processing Advances on Wireless Communications (SPAWC)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926460"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512"},{"key":"ref18","article-title":"Interference alignment feasibility in constant coefficient MIMO interference channels","author":"negro","year":"2010","journal-title":"Proc IEEE Int'l Workshop on Signal Processing Advances on Wireless Communications (SPAWC)"},{"key":"ref19","article-title":"Linear transceiver design for interference alignment","author":"razaviyayn","year":"2010","journal-title":"Comput Compl"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2012.6214448"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926344"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2009.5168956"},{"journal-title":"Settling the Feasibility of Interference Alignment for the MIMO Interference Channel The Symmetric Square Case","year":"2011","author":"bresler","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777171_0005"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2050480"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073899"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2301440"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592588"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WSA.2011.5741921"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2010.2082005"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2173683"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2192432"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2153198"},{"journal-title":"Combinatorial Optimization Polyhedra and Efficiency","year":"2003","author":"schrijver","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2241056"},{"journal-title":"Introduction to the Theory of Computation","year":"1997","author":"sipser","key":"ref26"},{"key":"ref25","first-page":"459","article-title":"Complexity of Bézout's theorem. I. Geometric aspects","volume":"6","author":"shub","year":"1993","journal-title":"J Amer Math Soc"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","start":{"date-parts":[[2015,4,26]]},"location":"Kowloon, Hong Kong","end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218531.pdf?arnumber=7218531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T18:12:52Z","timestamp":1498241572000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218531","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}