Generic Case Sample Clauses

Generic Case. When n = am3m + am−13m−1 + · · · + a13 + a0 (m ≥ 1, aj ∈ {0, 1, 2}, am ƒ= 0), our basic protocol runs as follows: ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ H4 \ Fig. 2. Our basic protocol (n = 17). For example, if n = 16 = 32 + 2 · 3 + 1, then N = 4, Step 1. (Partition) The peer group G is partitioned into subgroups at first. 1) Let i = 0 and j = 1. 2) If am−i = 1, let Hj be the subgroup of the H1 = U1, U2, , U9 , H2 = U10, U11, U12 , H3 = U13, U14, U15 , H4 = U16 , S0 = H4, S1 = H2 H3 S0, S2 = H1 S1. Our basic protocol in this generic case can be illustrated in Fig. 3. 3m−i members right after H if any and j = KG = KS2 j + 1. If a = 2, let H j−1 be the subgroup KH1 s ss zz m−i j ss z⁄z S1 of the 3m−i members right after Hj−1 if any, //\\ //\ m−i KH2 /< \ Hj+1 be the subgroup of the 3 members / ˆ \ / H3 ˆ /\ /\ /\ /\ /\ \’ K =K right after Hj and j = j + 2. 3) Let i = i + 1. If i ≤ m, go to 2. Σ · · · At the end of Step 1, G is partitioned into ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ ‘/ ˆ\’ \ H4 S0