{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:57Z","timestamp":1773377817508,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518029","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"646-651","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Thresholding Quantizer Maximizing Mutual Information of Discrete Multiple-Input Continuous One-Bit Output Quantization"],"prefix":"10.1109","author":[{"given":"Thuan","family":"Nguyen","sequence":"first","affiliation":[{"name":"Oregon State University,School of Electrical and Computer Engineering,Corvallis,OR,97331"}]},{"given":"Thinh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Oregon State University,School of Electrical and Computer Engineering,Corvallis,OR,97331"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1186\/s13660-017-1472-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.61117"},{"key":"ref30","author":"kirk","year":"2013","journal-title":"Handbook of Metric Fixed Point Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3002910"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3035525"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262919"},{"key":"ref14","first-page":"1","article-title":"Communication-channel optimized impurity partition","author":"nguyen","year":"2020","journal-title":"IEEE Global Communications Conference GlobeCom08"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849759"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620576"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174174"},{"key":"ref18","article-title":"Entropy-constrained maximizing mutual information quantization","author":"nguyen","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054469"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128966"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to construct polar codes","volume":"59","author":"tal","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282490"},{"key":"ref6","first-page":"448","article-title":"Low-Complexity Quantization of Discrete Memoryless Channels","author":"jiuyang zhang","year":"2016","journal-title":"Int Symp Information Theory Its Applications (ISITA)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC47757.2020.9049773"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6134417"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2015.7124674"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360795"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/0471219282.eot142"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006897"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.59943"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.66"},{"key":"ref23","article-title":"Optimal mutual information quantization is np-complete","author":"mumey","year":"0","journal-title":"Proc Neural Inf Coding (NIC) Workshop"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.12.080559"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417506"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518029.pdf?arnumber=9518029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:15Z","timestamp":1773347715000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518029","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}