As there are three different configurations for error zones (in the beginning, in the middle, and in the end of the path) and two different possibilities for retransmission of corrupted complementary packets (inside (I-Z) and outside (O-Z) of the error zone), we achieve six formulations for the average amount of information that is transmitted over the considered path.
(15) On account of two different possibilities arising here, we consider a partition ({mathbb{N}^{0},mathbb{N}^) of (mathbb{N}), i.e., (mathbb{N}^{0}cupmathbb{N}^=mathbb{N}) and (mathbb{N}^{0}capmathbb{N}^=emptyset) verifying that (i) (d(x_{n_{k}},x =0 ) (forall kinmathbb{N}^{0}), (ii) (d(x_{n_{k}},x >0 ) (forall kinmathbb{N}^). .
With respect to spatial interference alignment, precoding at the transmitter and decoding at the receiver can be performed in the frequency domain (the usual approach in the literature) or in the time domain, leading to a set of four different possibilities to apply spatial interference alignment precoding and decoding.
On account of the two different possibilities arising here, we consider a partition { N 0, N + } of ℕ, i.e., N 0 ∪ N + = N and N 0 ∩ N + = ∅ verifying that (i) d ( g g x n, g z ) = 0 ∀ n ∈ N 0, (ii) d ( g g x n, g z ) > 0 ∀ n ∈ N +. .
On account of the two different possibilities arising here, we consider a partition { N 0, N + } of ℕ, i.e., N 0 ∪ N + = N and N 0 ∩ N + = ∅ verifying that (i) d ( g x n, g u ) = 0 ∀ n ∈ N 0, (ii) d ( g x n, g u ) > 0 ∀ n ∈ N +. .
The film is composed of sections with three different possibilities for how it will play out, ensuring a different experience each time.
We compare two different possibilities.
Therefore, there were only six different possibilities per set, with minimal chances of over-fitting.
