Multiresidue codes for double error correction

P. Monteiro, T. Rao
{"title":"Multiresidue codes for double error correction","authors":"P. Monteiro, T. Rao","doi":"10.1109/ARITH.1972.6153889","DOIUrl":null,"url":null,"abstract":"A new class of (separate) multiresidue codes has been proposed, which is capable of double error correction. The codes are derived from a class of AN codes where A is of the form π i=1 3(2ki−1). Previously all discussions on separate code implementation had restricted themselves to single error correcting codes only. We have shown that these multiple-error correcting separate codes can be relatively easily implemented as the check bases are of the form 2k−1. A comparison with the multiresidue codes derived from Barrows-Mandelbaum codes has shown that these codes have in general a higher information rate and an easier implementation.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"162 1","pages":"1-13"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1972.6153889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A new class of (separate) multiresidue codes has been proposed, which is capable of double error correction. The codes are derived from a class of AN codes where A is of the form π i=1 3(2ki−1). Previously all discussions on separate code implementation had restricted themselves to single error correcting codes only. We have shown that these multiple-error correcting separate codes can be relatively easily implemented as the check bases are of the form 2k−1. A comparison with the multiresidue codes derived from Barrows-Mandelbaum codes has shown that these codes have in general a higher information rate and an easier implementation.
双重纠错的多残码
提出了一种新的(单独的)多残码,它具有双重纠错能力。这些码由一类AN码推导而来,其中a的形式为π i=1 3(2ki−1)。以前,所有关于单独代码实现的讨论都仅限于单个纠错代码。我们已经证明,这些多重纠错分离码可以相对容易地实现,因为校验基的形式是2k−1。与Barrows-Mandelbaum码的多残差码的比较表明,这些码通常具有较高的信息率和更容易实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信