{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:57Z","timestamp":1773377457783,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849336","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1187-1191","source":"Crossref","is-referenced-by-count":1,"title":["Orthogonal Precoder for Integer-Forcing MIMO"],"prefix":"10.1109","author":[{"given":"Mohammad Nur","family":"Hasan","sequence":"first","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)"}]},{"given":"Brian M.","family":"Kurkoski","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)"}]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University"}]},{"given":"Emanuele","family":"Viterbo","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Systems Engineering, Monash University"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Steepest gradient-based orthogonal precoder for integer-forcing MIMO","author":"hasan","year":"2019","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13467-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.03.015"},{"key":"ref14","article-title":"Random search algorithms","author":"zabinsky","year":"2009","journal-title":"Technical Report"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","article-title":"Minimization by random search techniques","volume":"6","author":"francisco","year":"1981","journal-title":"Math of Operations Res"},{"key":"ref16","first-page":"592","article-title":"How to generate random matrices from the classical compact groups","volume":"54","author":"mezzadri","year":"2007","journal-title":"Notices of the AMS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.090513.121465"},{"key":"ref18","article-title":"List of full diversity algebraic rotations","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2133650"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825045"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.908999"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2004.11.040"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2370047"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2419228"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2361782"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849336.pdf?arnumber=8849336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:48Z","timestamp":1773347628000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849336","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}