多信道系统单信道中多个非对称错误的编码

Charles H. Wolff
{"title":"多信道系统单信道中多个非对称错误的编码","authors":"Charles H. Wolff","doi":"10.1109/TEC.1962.5219427","DOIUrl":null,"url":null,"abstract":"An efficient error correction code for correcting errors of one kind in an arbitrary N-character message is discussed. The coded check character is obtained by summing the weighted coded characters (columns of binary digits where each binary digit assumes a unique weight) within an entire record modulo a prime integer. This check character is then added to the record before transmission over a channel (e.g., magnetic tape). A single parity check is appended to each character of the record to make possible single error detection per character. The received message, perturbed by noise in a constant position or single track, is decoded by again adding up the received information plus check characters in a modulo p counter. Error location is achieved by solving for x in the expression ax mod p, when a, the number of parity checks that failed, and ax mod p, the contents of a mod p counter, are known. This type of residue check may be employed to indicate which track is in error. Thus, error correction can be performed on the characters containig parity check failures.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1962-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coding for Multiple Asymmetric Errors in One Channel of a Multichannel System\",\"authors\":\"Charles H. Wolff\",\"doi\":\"10.1109/TEC.1962.5219427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient error correction code for correcting errors of one kind in an arbitrary N-character message is discussed. The coded check character is obtained by summing the weighted coded characters (columns of binary digits where each binary digit assumes a unique weight) within an entire record modulo a prime integer. This check character is then added to the record before transmission over a channel (e.g., magnetic tape). A single parity check is appended to each character of the record to make possible single error detection per character. The received message, perturbed by noise in a constant position or single track, is decoded by again adding up the received information plus check characters in a modulo p counter. Error location is achieved by solving for x in the expression ax mod p, when a, the number of parity checks that failed, and ax mod p, the contents of a mod p counter, are known. This type of residue check may be employed to indicate which track is in error. Thus, error correction can be performed on the characters containig parity check failures.\",\"PeriodicalId\":177496,\"journal\":{\"name\":\"IRE Trans. Electron. Comput.\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1962-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IRE Trans. Electron. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEC.1962.5219427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IRE Trans. Electron. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEC.1962.5219427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

讨论了一种有效的纠错码,用于纠错任意n字符报文中的一类错误。编码校验字符是通过将整个记录中的加权编码字符(每个二进制数字都有一个唯一的权重的二进制列)对素数取模而得到的。在通过通道(如磁带)传输之前,将这个校验字符添加到记录中。单个奇偶校验被附加到记录的每个字符上,以便对每个字符进行单个错误检测。接收到的信息在恒定位置或单轨道上受到噪声的干扰,通过在模p计数器中再次将接收到的信息加上校验字符相加来解码。错误定位是通过在表达式ax mod p中求解x来实现的,当a(失败的奇偶校验次数)和ax mod p (mod p计数器的内容)已知时。这种类型的残留检查可以用来指示哪条轨道是错误的。因此,可以对包含奇偶校验失败的字符执行纠错。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Coding for Multiple Asymmetric Errors in One Channel of a Multichannel System
An efficient error correction code for correcting errors of one kind in an arbitrary N-character message is discussed. The coded check character is obtained by summing the weighted coded characters (columns of binary digits where each binary digit assumes a unique weight) within an entire record modulo a prime integer. This check character is then added to the record before transmission over a channel (e.g., magnetic tape). A single parity check is appended to each character of the record to make possible single error detection per character. The received message, perturbed by noise in a constant position or single track, is decoded by again adding up the received information plus check characters in a modulo p counter. Error location is achieved by solving for x in the expression ax mod p, when a, the number of parity checks that failed, and ax mod p, the contents of a mod p counter, are known. This type of residue check may be employed to indicate which track is in error. Thus, error correction can be performed on the characters containig parity check failures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Electronic Generator of Random Numbers Real-Time Computation and Recursive Functions Not Real-Time Computable A Transistor Flip-Flop Full Binary Adder Bias-Controlled Tunnel-Pair Logic Circuits Analog-To-Digital Converter Utilizing an Esaki Diode Stack
×
引用
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