{"title":"Randomized chained polar subcodes","authors":"P. Trifonov","doi":"10.1109/WCNCW.2018.8369001","DOIUrl":null,"url":null,"abstract":"A generalization of polar subcodes is proposed, which enables a simple construction of codes of arbitrary length. The obtained codes are shown to outperform punctured and shortened polar codes under list/sequential decoding. Furthermore, a simplified Gaussian approximation for polar codes is presented.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2018.8369001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
A generalization of polar subcodes is proposed, which enables a simple construction of codes of arbitrary length. The obtained codes are shown to outperform punctured and shortened polar codes under list/sequential decoding. Furthermore, a simplified Gaussian approximation for polar codes is presented.