Yu, Ming; Sadeghi, Parastoo; Aboutorab, Neda
Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory without bridging index coding. We prove the equivalence between the DLNC solution and matrix matroid. We use this equivalence to study the performance limits of DLNC in terms of the number of transmissions and its dependence on the finite field size. Specifically,...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.