循环q元图像的编码和突发校正

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI:10.1109/ISIT.1994.394921

W. Wafo, J. Wolfmann

{"title":"循环q元图像的编码和突发校正","authors":"W. Wafo, J. Wolfmann","doi":"10.1109/ISIT.1994.394921","DOIUrl":null,"url":null,"abstract":"In the case where the cyclic code C is determined by a constancy-clique code described in Jensen's (see IEEE Trans. Inform. Theory, vol.38, p.950-959, 1992) theorem, we are able to find a lower bound for the minimum weight of C. By using the previous proposition we deduce lower bounds for the burst correction capacity of cyclic codes with composite lengths.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"165 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cyclic q-ary images of codes and burst correction\",\"authors\":\"W. Wafo, J. Wolfmann\",\"doi\":\"10.1109/ISIT.1994.394921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the case where the cyclic code C is determined by a constancy-clique code described in Jensen's (see IEEE Trans. Inform. Theory, vol.38, p.950-959, 1992) theorem, we are able to find a lower bound for the minimum weight of C. By using the previous proposition we deduce lower bounds for the burst correction capacity of cyclic codes with composite lengths.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"165 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394921\",\"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 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这种情况下，循环码C由Jensen的(参见IEEE翻译)中描述的恒常团码确定。通知。理论，vol.38, p.950-959, 1992)定理，我们能够找到c的最小权值的下界。通过使用前面的命题，我们推导出具有复合长度的循环码的突发校正能力的下界。

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

查看原文本刊更多论文

Cyclic q-ary images of codes and burst correction

In the case where the cyclic code C is determined by a constancy-clique code described in Jensen's (see IEEE Trans. Inform. Theory, vol.38, p.950-959, 1992) theorem, we are able to find a lower bound for the minimum weight of C. By using the previous proposition we deduce lower bounds for the burst correction capacity of cyclic codes with composite lengths.<>

求助全文

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

来源期刊

Proceedings of 1994 IEEE International Symposium on Information Theory

自引率

0.00%

发文量