{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:14:16Z","timestamp":1773843256055,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["1547450"],"award-info":[{"award-number":["1547450"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/tcomm.2020.3002910","type":"journal-article","created":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T20:57:57Z","timestamp":1592341077000},"page":"5435-5445","source":"Crossref","is-referenced-by-count":17,"title":["On Binary Quantizer For Maximizing Mutual Information"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3064-7609","authenticated-orcid":false,"given":"Thuan Duc","family":"Nguyen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5336-5773","authenticated-orcid":false,"given":"Thinh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","author":"kirk","year":"2013","journal-title":"Handbook Metric Fixed Point Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90039-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90346-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620576"},{"key":"ref13","first-page":"120","article-title":"Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet","author":"sakai","year":"2014","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810408"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262919"},{"key":"ref17","article-title":"Dynamic programming for sequential deterministic quantization of discrete memoryless channels","author":"he","year":"2019","journal-title":"arXiv 1901 01659"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348789"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006897"},{"key":"ref28","first-page":"1","article-title":"Optimal mutual information quantization is NP-complete","author":"mumey","year":"2003","journal-title":"Proc Neural Inf Coding (NIC) Workshop"},{"key":"ref4","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.12.080559"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/83.597270"},{"key":"ref6","first-page":"426","article-title":"Decoding LDPC codes with mutual information-maximizing lookup tables","author":"romero","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417505"},{"key":"ref8","article-title":"How to construct polar codes","author":"tal","year":"2011","journal-title":"arXiv 1105 6164"},{"key":"ref7","first-page":"1","article-title":"Soft information for LDPC decoding in flash: Mutual-information optimized quantization","author":"wang","year":"2011","journal-title":"Proc IEEE Global Telecommun Conf GLOBECOM"},{"key":"ref2","article-title":"Compressing deep convolutional networks using vector quantization","author":"gong","year":"2014","journal-title":"arXiv 1412 6115"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057548"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1986.1096503"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009869804967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006497"},{"key":"ref21","first-page":"448","article-title":"Low-complexity quantization of discrete memoryless channels","author":"zhang","year":"2016","journal-title":"Proc Int Symp Inf Theory and Its App (ISITA)"},{"key":"ref24","first-page":"1242","article-title":"New results on information theoretic clustering","author":"cicalese","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","first-page":"2860","article-title":"Binary partitions with approximate minimum impurity","author":"laber","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360795"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417506"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/9198256\/9118952-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9198256\/09118952.pdf?arnumber=9118952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:47:16Z","timestamp":1651067236000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9118952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":31,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3002910","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}