On the mis-correction due to any one extra bit error of Bose-Rao-Montgomery unidirectional error codes

M. Goto, T. Matsumoto
{"title":"On the mis-correction due to any one extra bit error of Bose-Rao-Montgomery unidirectional error codes","authors":"M. Goto, T. Matsumoto","doi":"10.1109/ICCS.1992.254885","DOIUrl":null,"url":null,"abstract":"By modifying the symmetric error correcting codes, Bose and Rao (1984) have obtained the unidirectional error-correcting (UEC) codes for shift register memories by using arithmetic redundancy check (ARC) in stead of cyclic redundancy check. Montgomery (see IEEE Trans. Comput., vol.40, p.1257, 1991) has proposed UEC code that correct any error pattern consisting of unidirectional errors confined to a single track. The UEC codes presented by Bose and Rao are a particular case of the codes by Montgomery. Although the latter is more efficient than the former, these two classes of code are constructed based on the same idea, and so the authors call these codes Bose Rao-Montgomery (BRM) codes. They consider the conditions under which such mis-corrections occur, and show that the row parity for each track is the suitable way of preventing from mis-corrections due to the single bit error in the other track.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.254885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

By modifying the symmetric error correcting codes, Bose and Rao (1984) have obtained the unidirectional error-correcting (UEC) codes for shift register memories by using arithmetic redundancy check (ARC) in stead of cyclic redundancy check. Montgomery (see IEEE Trans. Comput., vol.40, p.1257, 1991) has proposed UEC code that correct any error pattern consisting of unidirectional errors confined to a single track. The UEC codes presented by Bose and Rao are a particular case of the codes by Montgomery. Although the latter is more efficient than the former, these two classes of code are constructed based on the same idea, and so the authors call these codes Bose Rao-Montgomery (BRM) codes. They consider the conditions under which such mis-corrections occur, and show that the row parity for each track is the suitable way of preventing from mis-corrections due to the single bit error in the other track.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于玻色-拉奥-蒙哥马利单向错误码每多一个比特误差所引起的纠错
Bose和Rao(1984)通过修改对称纠错码,用算术冗余校验(ARC)代替循环冗余校验,获得了移位寄存器存储器的单向纠错码。Montgomery(参见IEEE Trans)。第一版。, vol.40, p.1257, 1991)提出了UEC代码,可以纠正任何由单一轨道的单向错误组成的错误模式。Bose和Rao提出的UEC码是Montgomery提出的码的一个特例。尽管后者比前者更有效,但这两类代码是基于相同的思想构造的,因此作者称这些代码为Bose Rao-Montgomery (BRM)代码。他们考虑了这种纠错发生的条件,并表明每个磁道的行奇偶校验是防止由于另一个磁道的单比特错误而引起的纠错的合适方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance analysis of interconnected LANS with server/client configuration An enhanced approach to character recognition by Fourier descriptor A new error control techinque for the parallel combinatory spread spectrum communication system Pattern recognition using optical binary perceptron Fast VQ algorithm using scalar prequantization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1