
Each user \(k\in {\mathcal {J}}\)  can recover \(W_{{\mathcal {J}}}\)  where \({\mathcal {J}}\in {\mathcal {G}}_{2}\)  by summing the received codewords (corresponding to \({\mathcal {G}}_{2}\) ) from the relays in \({\mathcal {H}}_{k}\) . We can see that our interference elimination scheme needs a field size larger than 7. Since the length of \(W_{{\mathcal {J}}}\) , equal to \({\mathsf {B}}/20\) , goes to infinity with \({\mathsf {B}}\rightarrow \infty \) . We can divide each \(W_{{\mathcal {J}}}\)  where \({\mathcal {J}}\in {\mathcal {V}}_{1}\)  into \(P\)  sub-packets with length \({\mathsf {B}}/(20P)\)  such that we can do operations with field size 7 for sub-packets. Notice that each file has \(20P\)  sub-packets. The link-load to transmit \(W_{{\mathcal {J}}}\)  where \({\mathcal {J}}\in {\mathcal {V}}_{1}\)  is \(2P/(20P)=1/10\) . The link-load for \({\mathcal {V}}_{1}\)  is \(1/10\)  such that the link-load of this scheme is \(3/2+1/10=8/5\) 
while the link-loads of the scheme in Section , in [1]}, [2]} and [3]} are \(5/3\) , \(19/6\) , \(29/12\)  and \(19/7\) , respectively.

