双同步纠错码基数的新界限

Proceedings of the 1992 South African Symposium on Communications and Signal Processing Pub Date : 1992-09-11 DOI:10.1109/COMSIG.1992.274293

A. Helberg, H. Ferreira

{"title":"双同步纠错码基数的新界限","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":"{\"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}","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

摘要

本文提出了改进的二进制码基数的上界和下界，能够纠正每个码字的一个或两个随机同步错误。这些边界是通过确定和考虑双同步纠错码的汉明距离性质而得到的。将这些新边界与已知边界进行比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

New bounds on the cardinality of double synchronization-error-correcting codes

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 1992 South African Symposium on Communications and Signal Processing

自引率

0.00%

发文量