{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:41:29Z","timestamp":1725666089180},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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,5]]},"DOI":"10.1109\/vtc2020-spring48590.2020.9128395","type":"proceedings-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T21:24:53Z","timestamp":1593552293000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["Thresholding Quantizer Design for Mutual Information Maximization Under Output Constraint"],"prefix":"10.1109","author":[{"given":"Thuan","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Thinh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Dynamic programming for discrete memoryless channel quantization","author":"he","year":"2019","journal-title":"arXiv preprint arXiv 1901 04217"},{"key":"ref11","article-title":"Minimizing impurity partition under constraints","author":"nguyen","year":"2019","journal-title":"arXiv preprint arXiv 1912 13141"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref13","article-title":"Optimal quantizer structure for binary discrete input continuous output channels under an arbitrary quantized-output constraint","author":"nguyen","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref14","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":"ref15","article-title":"How to construct polar codes","author":"tal","year":"2011","journal-title":"arXiv preprint arXiv 1105 6164"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840359"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00961"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006897"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804691"},{"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":"ref3","article-title":"Single-bit quantization capacity of binary-input continuous-output channels","author":"nguyen","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417506"},{"key":"ref8","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":"ref7","article-title":"On the uniqueness of binary quantizers for maximizing mutual information","author":"nguyen","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417505"},{"journal-title":"Elements of Information Theory","year":"2012","author":"m cover","key":"ref1"},{"key":"ref9","article-title":"Communication-channel optimized partition","author":"nguyen","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00103-X"}],"event":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","start":{"date-parts":[[2020,5,25]]},"location":"Antwerp, Belgium","end":{"date-parts":[[2020,5,28]]}},"container-title":["2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9121635\/9128361\/09128395.pdf?arnumber=9128395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T15:17:17Z","timestamp":1656602237000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9128395\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/vtc2020-spring48590.2020.9128395","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}