{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:54:44Z","timestamp":1729652084113,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282665","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1297-1301","source":"Crossref","is-referenced-by-count":4,"title":["On the construction of polar codes for channels with moderate input alphabet sizes"],"prefix":"10.1109","author":[{"given":"Ido","family":"Tal","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Upgraded approximation of non-binary alphabets for polar code construction","author":"ghayoori","year":"2013","journal-title":"arXiv 1304 1790v3"},{"key":"ref11","article-title":"An entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets","author":"guruswami","year":"2014","journal-title":"arXiv 1411 6993"},{"key":"ref12","first-page":"38","article-title":"Uber einen mittelwerthssatz","author":"holder","year":"1889","journal-title":"Nachr Akad Wiss G\ufffdttingen Math Phys Kl"},{"journal-title":"The Cauchy-Schwarz Master Class","year":"2004","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref15","volume":"2","author":"apostol","year":"1967","journal-title":"Calculus"},{"journal-title":"Mathematical Analysis","year":"1974","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283739"},{"key":"ref7","article-title":"Quantization of binary-input discrete memoryless channels, with applications to LDPC decoding","author":"kurkoski","year":"2011","journal-title":"arXiv 11107 5637vl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351487"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"ankan","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874865"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282665.pdf?arnumber=7282665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:37:59Z","timestamp":1498235879000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282665","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}