Table 1 Pool ‘ C ’, unique combinations out of 462 combinations, which result in least number of K 1 and K 2 cases \( {C}_3\subseteq \left\{{\tilde{C}}_3\right\} \)
Serial number | Pool ‘ C ’ | K 1 | K 2 |
|---|---|---|---|
Sequence of bit positions | |||
1 | 6,7,8,9,10 | 4 | 30 |
2 | 6,7,8,9,11 | 4 | 24 |
3 | 6,7,810,11 | 4 | 20 |
4 | 6,7,9,10,11 | 4 | 36 |
5 | 6,8,9,10,11 | 4 | 24 |
6 | 7,8,9,10,11 | 4 | 24 |