{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:21:41Z","timestamp":1765808501983},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"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,12]]},"DOI":"10.1109\/globecom42002.2020.9322342","type":"proceedings-article","created":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T19:51:27Z","timestamp":1611604287000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Communication-Channel Optimized Impurity Partition"],"prefix":"10.1109","author":[{"given":"Thuan","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Thinh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3002910"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128395"},{"key":"ref12","article-title":"How to construct polar codes","author":"tal","year":"2011","journal-title":"arXiv preprint arXiv 1105 6164"},{"key":"ref13","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810408"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2018.8464844"},{"key":"ref16","article-title":"The information bottleneck method","author":"tishby","year":"2000","journal-title":"ArXiv Preprint"},{"key":"ref17","first-page":"2860","article-title":"Binary partitions with approximate minimum impurity","author":"laber","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2019.08.050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054763"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009869804967"},{"key":"ref6","article-title":"Minimizing impurity partition under constraints","author":"nguyen","year":"2019","journal-title":"arXiv preprint arXiv 1912 13141"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref8","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174174"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348789"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/34.88569"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417506"}],"event":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","start":{"date-parts":[[2020,12,7]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2020,12,11]]}},"container-title":["GLOBECOM 2020 - 2020 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9322055\/9321973\/09322342.pdf?arnumber=9322342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:39:00Z","timestamp":1656329940000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9322342\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/globecom42002.2020.9322342","relation":{},"subject":[],"published":{"date-parts":[[2020,12]]}}}