字节单向纠错码

[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers Pub Date : 1989-06-21 DOI:10.1109/FTCS.1989.105570

B. Bose

{"title":"字节单向纠错码","authors":"B. Bose","doi":"10.1109/FTCS.1989.105570","DOIUrl":null,"url":null,"abstract":"Efficient byte unidirectional error correcting codes that are better than byte symmetric error correcting codes are presented. The encoding and decoding algorithms are discussed. Lower bounds on the number of check bits for byte unidirectional error correcting codes are derived, and it is shown that the codes given here are close to optimal. Codes for asymmetric errors are also described.<<ETX>>","PeriodicalId":230363,"journal":{"name":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"10 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Byte unidirectional error correcting codes\",\"authors\":\"B. Bose\",\"doi\":\"10.1109/FTCS.1989.105570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient byte unidirectional error correcting codes that are better than byte symmetric error correcting codes are presented. The encoding and decoding algorithms are discussed. Lower bounds on the number of check bits for byte unidirectional error correcting codes are derived, and it is shown that the codes given here are close to optimal. Codes for asymmetric errors are also described.<<ETX>>\",\"PeriodicalId\":230363,\"journal\":{\"name\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"10 9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1989.105570\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1989.105570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

提出了一种比字节对称纠错码更有效的字节单向纠错码。讨论了编码和解码算法。导出了字节单向纠错码的校验位数的下界，并证明了所给出的码是接近最优的。还描述了非对称错误的代码。

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

查看原文本刊更多论文

Byte unidirectional error correcting codes

Efficient byte unidirectional error correcting codes that are better than byte symmetric error correcting codes are presented. The encoding and decoding algorithms are discussed. Lower bounds on the number of check bits for byte unidirectional error correcting codes are derived, and it is shown that the codes given here are close to optimal. Codes for asymmetric errors are also described.<>

求助全文

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

来源期刊

[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers

自引率

0.00%

发文量