On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 14.98 |
The authors present an evaluation of signature analysis efficiency which does not rely on assumptions about the distribution of the analyzed error sequences. This is achieved through the use of an 'a priori randomization' technique, which leads to a choice of LFSRs (linear feedback shift registers) corresponding to randomly chosen irreducible polynomials of a given degree. As it does not make use of assumptions on the error distribution, the proposed evaluation is more pessimistic than the usual ones. In particular, it takes into account the length of the analyzed sequence. However, it can be valuable when the efficiency of signature analysis has to be guaranteed, for highly dependable applications for instance.