Algorithm A2 Caching and Delivery Scheme with Inactive Users $(N,K,M)$

procedure  PLACEMENT ($W_1,\dots ,W_N$)   1:Apply Algorithm 1 MAN Uncoded Symmetric Placement Scheme ($N,K,M,W_{\left[N\right]}$) end procedure    procedure  DELIVERY ($\mathcal{R},D_{\mathcal{R}}$)   2: $t\leftarrow KM/N$   3:$N_e\left(D_{\mathcal{R}}\right)\leftarrow$ the number of distinct elements in $D_{\mathcal{R}}$   4: $\widehat{\mathcal{U}}\leftarrow \{{\widehat{u}}_1,...,{\widehat{u}}_{N_e\left(D_{\mathcal{R}}\right)}\}$   5:for  $\mathcal{H}\subseteq \left[K\right]:\left|\mathcal{H}\right|=t+1$  do   6: if  $\mathcal{H}\cap \widehat{\mathcal{U}}==\varnothing$  then   7:  continue   8: else   9:  Central server transmits $Y_{\mathcal{H}}=\underset{x\in \mathcal{H}:d_x\in D_{\mathcal{R}}}{⨁}{W}_{d_x,\mathcal{H}\setminus \left\{x\right\}}$ 10: end if 11: end for end procedure