{"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}
引用次数: 0
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.
讨论了一种有效的纠错码,用于纠错任意n字符报文中的一类错误。编码校验字符是通过将整个记录中的加权编码字符(每个二进制数字都有一个唯一的权重的二进制列)对素数取模而得到的。在通过通道(如磁带)传输之前,将这个校验字符添加到记录中。单个奇偶校验被附加到记录的每个字符上,以便对每个字符进行单个错误检测。接收到的信息在恒定位置或单轨道上受到噪声的干扰,通过在模p计数器中再次将接收到的信息加上校验字符相加来解码。错误定位是通过在表达式ax mod p中求解x来实现的,当a(失败的奇偶校验次数)和ax mod p (mod p计数器的内容)已知时。这种类型的残留检查可以用来指示哪条轨道是错误的。因此,可以对包含奇偶校验失败的字符执行纠错。