We also compare numerically the max link-loads of our proposed caching schemes to the proposed outer bounds and the schemes in [1]}, [2]} and [3]}. Firstly, we consider the case with \({\mathsf {K}}={\mathsf {N}}={\mathsf {H}}=4\)  and \({\mathsf {r}}=3\) . Fig. REF  shows that the proposed scheme in Section  outperforms the schemes in [1]} and [3]}. As stated in Theorem REF , the proposed achievable inner bound coincides with the outer bound under the constraint of uncoded placement. Then, we consider the case of \({\mathsf {H}}\in [4:8]\) , \({\mathsf {K}}={\mathsf {N}}\) , \({\mathsf {r}}=2\)  and \({\mathsf {M}}=1\)  to shows in Fig. REF  that our proposed coding scheme with the interference elimination in Section  and the proposed scheme in Section  outperform the state of the art.
<FIGURE>