{"title":"有界单插入/删除纠错码","authors":"Takayuki Nozaki","doi":"10.1109/ISIT.2019.8849583","DOIUrl":null,"url":null,"abstract":"A code is bounded single insertion/deletion correcting if a decoder corrects a single insertion or single deletion with side information about a range of positions occurring an inserted symbol or deleted symbol. This paper constructs two bounded single insertion/deletion correcting codes and gives decoding algorithms for these. Moreover, we evaluate the number of codewords of these codes. As a result, the constructed codes have larger cardinalities than the existing ones.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"102 1","pages":"2379-2383"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Bounded Single Insertion/Deletion Correcting Codes\",\"authors\":\"Takayuki Nozaki\",\"doi\":\"10.1109/ISIT.2019.8849583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A code is bounded single insertion/deletion correcting if a decoder corrects a single insertion or single deletion with side information about a range of positions occurring an inserted symbol or deleted symbol. This paper constructs two bounded single insertion/deletion correcting codes and gives decoding algorithms for these. Moreover, we evaluate the number of codewords of these codes. As a result, the constructed codes have larger cardinalities than the existing ones.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"102 1\",\"pages\":\"2379-2383\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"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.8849583\",\"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.8849583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bounded Single Insertion/Deletion Correcting Codes
A code is bounded single insertion/deletion correcting if a decoder corrects a single insertion or single deletion with side information about a range of positions occurring an inserted symbol or deleted symbol. This paper constructs two bounded single insertion/deletion correcting codes and gives decoding algorithms for these. Moreover, we evaluate the number of codewords of these codes. As a result, the constructed codes have larger cardinalities than the existing ones.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
