{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:40Z","timestamp":1773377740312,"version":"3.50.1"},"reference-count":16,"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.8849759","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"450-454","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Programming for Quantization of q-ary Input Discrete Memoryless Channels"],"prefix":"10.1109","author":[{"given":"Xuan","family":"He","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design (SUTD), 487372, Singapore"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design (SUTD), 487372, Singapore"}]},{"given":"Wentu","family":"Song","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design (SUTD), 487372, Singapore"}]},{"given":"Zhen","family":"Mei","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design (SUTD), 487372, Singapore"}]}],"member":"263","reference":[{"key":"ref10","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 IEEE Int Symp Inf Theory and its Applications"},{"key":"ref11","first-page":"448","article-title":"Low-complexity quantization of discrete memoryless channels","author":"zhang","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory and its Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804691"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644032"},{"key":"ref14","article-title":"Dynamic programming for discrete memoryless channel quantization","author":"he","year":"2019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006497"},{"key":"ref16","first-page":"2854","article-title":"Binary partitions with approximate minimum impurity","volume":"80","author":"laber","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref5","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2533498"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613421"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840359"}],"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\/08849759.pdf?arnumber=8849759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:02Z","timestamp":1773347702000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849759\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849759","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}