{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:29:06Z","timestamp":1729628946467,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282706","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1502-1506","source":"Crossref","is-referenced-by-count":7,"title":["When does an ensemble of matrices with randomly scaled rows lose rank?"],"prefix":"10.1109","author":[{"given":"Aly","family":"El Gamal","sequence":"first","affiliation":[]},{"given":"Navid","family":"Naderializadeh","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"565","article-title":"On determinants, matchings and random algorithms","author":"lovasz","year":"1979","journal-title":"Fundamentals of Computation Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215915"},{"key":"ref10","article-title":"Topological interference management with just retransmission: What are the &#x201C;best&#x201D; topologies?","author":"naderializadeh","year":"2015","journal-title":"arXiv 1502 03147 to appear at IEEE International Conference on Communications (ICC)"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","article-title":"Probabilistic Algorithms for Sparse Polynomials","author":"zippel","year":"1979","journal-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"ref8","article-title":"When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?","author":"naderializadeh","year":"0","journal-title":"arXiv 1501 07544"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2387162"},{"key":"ref9","volume":"24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282706.pdf?arnumber=7282706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:37:50Z","timestamp":1498235870000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282706","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}