Algorithm 3. Pseudo-code for action preparation

input: T with the bit-collision cases in each internal node output: T with the bit-collision cases and their actions in each internal node 1.   $H\left(T_{\pi }\right)$ 2.   function $H\left(n\right)$ 3.    if $n_l$ ≠ leaf node then$H\left(n_l\right)$ end if 4.    if $n_r$ ≠ leaf node then $H\left(n_r\right)$ end if 5.    for (i=1; i ≤ |$Z_n$|, i++) do 6.      $D$ $\leftarrow$ get the largest group of tag IDs in $Y_{n,i}$ 7.     for each $d\in D$ do 8.       if $d$ appears in all combinations, where combination j has $Y_{n,j}=Y_{n,i}$ then $a$ $\leftarrow$ “READ” 9.       else if $d$ disappears in all combinations, where combination j has $Y_{n,j}=Y_{n,i}$ then $a$ $\leftarrow$ “ABSENCE” 10.        else $a\leftarrow$“COUPLING” end if 11.      end if 12.     $\mathrm{add} ($d, $Y_{n,i}$, a) into $Ac{t}_n$ 13.    end for 14.    if all actions in $Ac{t}_n$ are “COUPLING,” then $a$ $\leftarrow$ “SPLIT” end if 15.   end for 16. end function