{"title":"基于可信符号的改进产品代码迭代解码","authors":"C. Senger","doi":"10.1109/ISIT.2019.8849469","DOIUrl":null,"url":null,"abstract":"Iterative decoding of product codes constructed from constituent generalized Reed–Solomon codes (or subcodes thereof, such as Bose–Chaudhuri–Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"97 1","pages":"1342-1346"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Improved Iterative Decoding of Product Codes Based on Trusted Symbols\",\"authors\":\"C. Senger\",\"doi\":\"10.1109/ISIT.2019.8849469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Iterative decoding of product codes constructed from constituent generalized Reed–Solomon codes (or subcodes thereof, such as Bose–Chaudhuri–Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"97 1\",\"pages\":\"1342-1346\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved Iterative Decoding of Product Codes Based on Trusted Symbols
Iterative decoding of product codes constructed from constituent generalized Reed–Solomon codes (or subcodes thereof, such as Bose–Chaudhuri–Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
