{"title":"New bounds on the cardinality of double synchronization-error-correcting codes","authors":"A. Helberg, H. Ferreira","doi":"10.1109/COMSIG.1992.274293","DOIUrl":null,"url":null,"abstract":"This paper presents improved upper and lower bounds on the cardinality of binary codes capable of correcting one or two random synchronization errors per codeword. These bounds were derived by determining and considering the Hamming distance properties of the double synchronization-error-correcting codes. These new bounds are compared with known bounds for such codes.<<ETX>>","PeriodicalId":342857,"journal":{"name":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1992.274293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents improved upper and lower bounds on the cardinality of binary codes capable of correcting one or two random synchronization errors per codeword. These bounds were derived by determining and considering the Hamming distance properties of the double synchronization-error-correcting codes. These new bounds are compared with known bounds for such codes.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
