Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks

. 2024 Mar 12;26(3):250. doi: 10.3390/e26030250

Algorithm 1 MAN Uncoded Symmetric Placement Scheme

(N, K, M, W_{[N]})

1:
$t \leftarrow K M / N$
2:
$T \leftarrow {𝒯 \subseteq [K] : | 𝒯 | = t}$
3:
for $n \in N$ do
4:
Divide file $W_{n}$ into disjoint sub-files ( $W_{n, 𝒯} : 𝒯 \in T$ ) with equal size
5:
end for
6:
for $k \in [K]$ do
7:
$Z_{k} \leftarrow (W_{n, 𝒯} : n \in [N], 𝒯 \in T$ , $k \in 𝒯)$
8:
end for