{"title":"关于通道极化速度","authors":"Toshiyuki TANAKA","doi":"10.1109/CIG.2010.5592869","DOIUrl":null,"url":null,"abstract":"We review some recent progresses in studies on speed of channel polarization. Firstly, results on a coderate-dependent upper bound of block error probability of polar codes with successive cancellation decoding are reviewed. Then an approach of constructing polar codes for non-binary input alphabet with asymptotic speed of polarization much faster than previous approaches is briefly described.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On speed of channel polarization\",\"authors\":\"Toshiyuki TANAKA\",\"doi\":\"10.1109/CIG.2010.5592869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We review some recent progresses in studies on speed of channel polarization. Firstly, results on a coderate-dependent upper bound of block error probability of polar codes with successive cancellation decoding are reviewed. Then an approach of constructing polar codes for non-binary input alphabet with asymptotic speed of polarization much faster than previous approaches is briefly described.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We review some recent progresses in studies on speed of channel polarization. Firstly, results on a coderate-dependent upper bound of block error probability of polar codes with successive cancellation decoding are reviewed. Then an approach of constructing polar codes for non-binary input alphabet with asymptotic speed of polarization much faster than previous approaches is briefly described.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
