公开(公告)号：US07272777B2

公开(公告)日：2007-09-18

申请号：US10453550

申请日：2003-06-04

申请人： Martin Aureliano Hassner ,  Barry Marshall Trager ,  Shumel Winograd

发明人： Martin Aureliano Hassner ,  Barry Marshall Trager ,  Shumel Winograd

IPC分类号： H03M13/00

CPC分类号： H03M13/15

摘要： An efficient method for finding all the possible corrections of a bust of length b and e random errors consists of finding a polynomial whose roots are the candidate location for l—the location of the beginning of the burst—thus avoiding the search over all possible values of l (it is assumed that the burst is non-trivial, i.e., at least one of its errors has a non-zero value). In order to reduce the number of spurious solutions, it is assumed that the number of syndromes is t=2e+b+s, where s is at least 2. The larger the value of s the less likely it is that the algorithm will generate “spurious” solutions. Once the location of the burst is known, standard procedures are used to determine the magnitudes of the burst errors and the location and magnitude of the random errors.

摘要翻译： 发现长度为b和e的随机误差的所有可能的校正的有效方法包括找出一个多项式，其根是脉冲串开始位置的候选位置，从而避免搜索所有可能的值 （假设突发是不平凡的，即其错误中的至少一个具有非零值）。 为了减少杂散解的数量，假定综合征的数量为t = 2e + b + s，其中s为至少2. s的值越大，算法将产生的可能性越小 “虚假”解决方案。 一旦突发的位置是已知的，则使用标准程序来确定突发错误的大小以及随机误差的位置和幅度。