Algorithm A1 Adapted YWSC Scheme $(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: $r\leftarrow |D_{\mathcal{R}}|$   3: $t\leftarrow KM/N$   4:Assign the users, who do not request, a demand that is the most requested by the requesters and has $D_{\mathcal{K}}^{\prime }\leftarrow D_{\mathcal{R}}$   5:𝒢  $\leftarrow \{\mathcal{G}\subseteq [K]:|\mathcal{G}|=t\}$   6:for  $n\in \left[N\right]$  do   7: for  $\mathcal{G}\in$ 𝒢 do   8:  Divide sub-file $W_{n,\mathcal{G}}$ into t disjoint sub-pieces $(W_{n,\mathcal{G},i}:i\in \mathcal{G})$ with equal size   9: end for 10: end for 11:for  $i\in \mathcal{K}$  do 12: $N_e\left(D_{\mathcal{K}\setminus \left\{i\right\}}^{\prime }\right)\leftarrow$ the number of distinct elements in $D_{\mathcal{K}\setminus \left\{i\right\}}^{\prime }$ 13: $\overline{{\mathcal{U}}^i}\leftarrow \{u_1^i,...,u_{N_e\left(D_{\mathcal{K}\setminus \left\{i\right\}}^{\prime }\right)}^i\}$ from $\mathcal{R}$ as much as possible 14: for ${\mathcal{E}}^i\subseteq \mathcal{K}\setminus \left\{i\right\}:\left|{\mathcal{E}}^i\right|=t$ users do 15:  if  ${\mathcal{E}}^i\cap \overline{{\mathcal{U}}^i}==\varnothing$  then 16:   continue 17:  else if ${\mathcal{E}}^i\subseteq \mathcal{K}\setminus \mathcal{R}$ then 18:   continue 19:  else 20:   User i transmits $Y_{{\mathcal{E}}^i}^i=\underset{k\in {\mathcal{E}}^i}{⨁}{W}_{d_k,\{{\mathcal{E}}^i\cup \left\{i\right\}\}\setminus \left\{k\right\},i}$ 21:  end if 22: end for 23: end for end procedure