{"title":"Burst and unidirectional error detecting codes","authors":"S. Al-Bassam, B. Bose, R. Venkatesan","doi":"10.1109/FTCS.1991.146689","DOIUrl":null,"url":null,"abstract":"It is proved that codes devised by J. Berger (see Inf., and Control. vol.4, p.68-73, (1961)) that detect random bursts of length b and simultaneously detect any number of unidirectional errors (b-bED/AUED codes) are optimal. The construction is modified in two ways: (1) to obtain b-bED/s-UED codes in which a random burst of length b and up to s unidirectional errors are detected, and (2) to obtain b-bED/s-UbED codes in which a random burst of length b and a unidirectional burst of length s are detected. A lower bound on the number of check bits for such codes is obtained. The lower bounds indicate that the proposed b-bED/s-UED codes are close to optimal and the b-bED/s-UbED codes are asymptotically optimal.<<ETX>>","PeriodicalId":300397,"journal":{"name":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1991.146689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
It is proved that codes devised by J. Berger (see Inf., and Control. vol.4, p.68-73, (1961)) that detect random bursts of length b and simultaneously detect any number of unidirectional errors (b-bED/AUED codes) are optimal. The construction is modified in two ways: (1) to obtain b-bED/s-UED codes in which a random burst of length b and up to s unidirectional errors are detected, and (2) to obtain b-bED/s-UbED codes in which a random burst of length b and a unidirectional burst of length s are detected. A lower bound on the number of check bits for such codes is obtained. The lower bounds indicate that the proposed b-bED/s-UED codes are close to optimal and the b-bED/s-UbED codes are asymptotically optimal.<>
经证明,由J. Berger设计的码(见附录)和Control。vol.4, p.68-73,(1961))检测长度为b的随机突发并同时检测任意数量的单向错误(b- bed /AUED码)是最优的。对结构进行了两种修改:(1)得到长度为b的随机突发和最多5个单向错误的b- bed /s- ued码;(2)得到长度为b的随机突发和长度为s的单向突发的b- bed /s- ued码。得到了这种码的校验位数的下界。下界表明所提出的b-bED/s-UED码接近最优,b-bED/s-UED码是渐近最优的。