{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:39Z","timestamp":1773377799274,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174174","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1450-1455","source":"Crossref","is-referenced-by-count":6,"title":["Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output Constraints"],"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,97331"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006897"},{"key":"ref11","article-title":"Single-bit quantization capacity of binary-input continuous-output channels","author":"nguyen","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417506"},{"key":"ref13","article-title":"Dynamic programming for discrete memoryless channel quantization","author":"he","year":"2019"},{"key":"ref14","first-page":"1932","article-title":"Optimal mutual information quantization is np-complete","author":"mumey","year":"2003","journal-title":"Neural Information Coding (NIC) workshop poster"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC47757.2020.9049773"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054763"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840359"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365532"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911170"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348789"},{"key":"ref4","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":"ref27","doi-asserted-by":"publisher","DOI":"10.32614\/RJ-2011-015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620576"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2015.7124674"},{"key":"ref7","first-page":"120","article-title":"Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet","author":"yuta sakai","year":"2014","journal-title":"2014 International Symposium on Information Theory and its Applications ISITA"},{"key":"ref2","first-page":"426","article-title":"Decoding ldpc codes with mutual information-maximizing lookup tables","author":"javier","year":"2015","journal-title":"Information Theory (ISIT) 2015 IEEE International Symposium on"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262919"},{"key":"ref1","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935892"},{"key":"ref22","article-title":"Vector quantization and signal compression","author":"gersho","year":"1991","journal-title":"The Kluwer International Series in Engineering And Computer Science"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/29.17498"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00961"},{"key":"ref23","author":"zhao","year":"2008","journal-title":"On entropy-constrained vector quantization using"},{"key":"ref26","first-page":"1705","article-title":"Clustering with bregman divergences","volume":"6","author":"banerjee","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref25","author":"nguyen","year":"2019","journal-title":"Minimizing impurity partition under constraints"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174174.pdf?arnumber=9174174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:11Z","timestamp":1773347711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174174\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174174","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}