{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T04:14:56Z","timestamp":1789100096705,"version":"build-2803163510"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1109\/tcomm.2021.3120274","type":"journal-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T05:56:03Z","timestamp":1634277363000},"page":"185-198","source":"Crossref","is-referenced-by-count":29,"title":["Construction of Polar Codes With Reinforcement Learning"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9960-1118","authenticated-orcid":false,"given":"Yun","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5679-8654","authenticated-orcid":false,"given":"Seyyed Ali","family":"Hashemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1353-8101","authenticated-orcid":false,"given":"John M.","family":"Cioffi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5686-800X","authenticated-orcid":false,"given":"Andrea","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9348092"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref3","article-title":"Final report of 3GPP TSG RAN WG1 #87 v1.0.0","volume-title":"3GPP","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.090428"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.081512.110872"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541293"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254146"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2017.2759253"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345069"},{"key":"ref15","volume-title":"Introduction to Reinforcement Learning","volume":"135","author":"Sutton","year":"1998"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2889667"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2607169"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422462"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504269"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2656126"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2908870"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2951403"},{"key":"ref23","article-title":"A RM-polar codes","author":"Li","year":"2014","journal-title":"arXiv:1407.5483"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.30420\/454862022"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM50965.2020.9179593"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919804"},{"key":"ref27","first-page":"323","article-title":"Using eligibility traces to find the best memoryless policy in partially observable Markov decision processes","volume-title":"Proc. ICML","author":"Loch"},{"key":"ref28","first-page":"1","article-title":"Learning policies with external memory","volume-title":"Proc. ICML","author":"Peshkin"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9681827\/09570303.pdf?arnumber=9570303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:22:39Z","timestamp":1705015359000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9570303\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2021.3120274","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]}}}