literature are the following:

1.  Error correction [@cai-yeung]: Several packets are injected on some links in the network, hence the sink receives $$\mathbf{y} = \mathbf{c} A^T + \mathbf{e} \in \mathbb{F}_{q^m}^N,$$ for an error vector $ \mathbf{e} \in \mathbb{F}_{q^m}^N $.

2.  Information leakage [@secure-network]: A wire-tapper listens to $ \mu > 0 $ links in the network, obtaining $$\mathbf{z} = \mathbf{c} B^T \in \mathbb{F}_{q^m}^{\mu},$$ for a matrix $ B \in \mathbb{F}_q^{\mu \times n} $.

In [@on-metrics], it is proven that rank-metric codes are suitable for error correction when used as forward error-correcting codes, and in [@silva-universal], it is proven that they are also suitable to protect messages from information leakage when used as coset coding schemes, which were introduced in [@wyner] and [@ozarow]. Both coding techniques can be treated separately and applied together in a concatenated way (see [@silva-universal Sec. VII-B]).

Moreover, rank-metric codes are *universal* [@silva-universal] in the sense that they correct a given number of errors and erasures, and protect against a given number of wire-tapped links, independently of the matrices $ A $ and $ B $, respectively.

We consider the particular coding schemes in [@silva-universal Sec. V-B] with uniform distributions:

\[**[@silva-universal]**\] \[definition ozarow\] Given an $ \mathbb{F}_{q^m} 