{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:13Z","timestamp":1773377713479,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834446","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2130-2135","source":"Crossref","is-referenced-by-count":1,"title":["Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length"],"prefix":"10.1109","author":[{"given":"Samet","family":"Gelincik","sequence":"first","affiliation":[{"name":"Univ Rennes,INSA Rennes, CNRS,Rennes,France,F-35000"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Mary","sequence":"additional","affiliation":[{"name":"Univ Rennes,INSA Rennes, CNRS,Rennes,France,F-35000"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Savard","sequence":"additional","affiliation":[{"name":"IMT Nord Europe,Institut Mines Télécom, Centre for Digital Systems,France,F-59653"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Baudais","sequence":"additional","affiliation":[{"name":"Univ Rennes,INSA Rennes, CNRS,Rennes,France,F-35000"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2020.2981432"},{"key":"ref11","article-title":"From sequential decoding to channel polarization and back again","author":"ar?kan","year":"2019"},{"key":"ref12","article-title":"On pre-transformed polar codes","author":"li","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2908870"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3069668"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref16","article-title":"A pre-transformation method to increase the minimum distance of polar-like codes","author":"gelincik","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/e22060690"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541293"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.111612.121898"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2967127"},{"key":"ref3","year":"2018","journal-title":"Multiplexing and Channel Coding (3GPP TS 38 212 V15 3 0 Release 15)"},{"key":"ref6","first-page":"1","article-title":"Polar code construction for list decoding","author":"yuan","year":"2019","journal-title":"Int ITG Conf Syst Comm Coding"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504269"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3014946"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref1","first-page":"1","article-title":"Achieving PAC code performance without extra computational complexity","author":"gelincik","year":"0","journal-title":"IEEE Int Conf Communications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2672539"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834446.pdf?arnumber=9834446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:56Z","timestamp":1773347696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834446","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}