### Table 1. Polynomials and number of MPRES calls of the IPRES test cases 12

1995

"... In PAGE 12: ... Due to that also the number of MPRES calls changes. Table1 shows the test cases. The SAC-2 function IPRAN() generates an integral random polynomial.... ..."

Cited by 16

### Table 1. Polynomials and number of MPRES calls of the IPRES test cases

1995

"... In PAGE 12: ... Due to that also the number of MPRES calls changes. Table1 shows the test cases. The SAC-2 function IPRAN() generates an integral random polynomial.... ..."

Cited by 16

### Table 2: Number of Exceptional Polynomials

1994

"... In PAGE 9: ... If there is the same probability that a randomly chosen candidate is primitive, then the number of primitive candidates should be #283=4#29 r,1 #15 2 #28r#29, and #17#28r#29 should be half this number. In Table2 we give #16 #17#28r#29= #17#28r#29 #283=4#29 r #15 2 #28r#29 ; the numerical evidence suggests that #16 #17#28r#29 converges to a positive constant#16#17#281#29asr !1.However, #16 #17#281#29 is less than the value 2#2F3 predicted by the heuristic argument.... In PAGE 9: ...However, #16 #17#281#29 is less than the value 2#2F3 predicted by the heuristic argument. Our best estimate #28obtained from a separate computation which gives faster convergence#29 is #16 #17#281#29=0:45882 #06 0:00002 The computation of Table2 took 166 hours on a VaxStation 3100. We outline the method used.... In PAGE 10: ... The complexity of the combination is conjectured to be O #20 r 2 2 r #12 3 4 #13 #286r+5s#29=12 ! = O #20 r 2 3 r=2 #12 3 4 #13 5s=12 ! ; where the exponent5s=12 #28instead of s=2#29 re#0Dects the lack of independence. In the computation of Table2 we used s #14 22 because of memory constraints. The table size is O#28s3 s=2 #29 bits if the table is stored as a list to take advantage of sparsity.... ..."

Cited by 33

### Table 3: Number of errors as a function of the order of polynomial and the number of important genes removed.

1999

Cited by 36

### Table 3: Number of errors as a function of the order of polynomial and the number of important genes removed.

1999

Cited by 36

### Table 3.1: Number of errors as a function of the order of polynomial and the number

### Table 2. Polynomials and number of MPRES calls of the MPRES test cases. M means MPHOM and I means IPRAN.

1995

Cited by 16

### Table 2. Polynomials and number of MPRES calls of the MPRES test cases. M means MPHOM and I means IPRAN.

1995

Cited by 16

### Table 4. Coefficients in the polynomial fit to the variance of the number of neighbors

### Table 1: Generator polynomials with di erent number of neighbours.

"... In PAGE 1: ... A good selection criteria is to maximise d2 as well as minimise N2 [5]. In Table1 we list two di erent generator poly- nomials for an eight state, rate 2/3 systematic convolutional encoder that have similar distance pro les. The distance terms d2 and d3 are the minimum Hamming weight paths for information weight two and three, respectively.... ..."