5 problems

Let $\mathcal{N}$ be a multicast network, and let $GF(q)$ denote a finite field. The network is linearly solvable over $GF(q)$ if it admits a linear network code over that field. S…

Let $n$ be the number of nodes, and let $k$ denote the pre-selected number of nodes participating in selective multicast. Write $\Delta^S_{(k)}$ for the original average age functi…

Let $L$ and $q$ be positive integers, and consider multicast networks with vector linear network coding (LNC) of dimension $L$ over $\operatorname{GF}(q)$ and scalar linear network…

Non-uniform delay-and-code conjecture. A feasible multicast network code can be designed using a non-uniform delay-and-code scheme.

Bounded-delay existence conjecture. There exists a finite value $I$, depending on the graph and in particular on $T(e)$, such that one can choose delays satisfying $i_e(p)<I$ for e…