On Base Field of Linear Network Coding
From MaRDI portal
Abstract: For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we design a new class of multicast networks and obtain an explicit formula for the linear solvability of these networks, which involves the associated coset numbers of a multiplicative subgroup in a base field. The concise formula turns out to be the first that matches the topological structure of a multicast network and algebraic identities of a field other than size. It further facilitates us to unveil emph{infinitely many} new multicast networks linearly solvable over GF() but not over GF() with , based on a subgroup order criterion. In particular, i) for every , an instance in can be found linearly solvable over GF() but emph{not} over GF(), and ii) for arbitrary distinct primes and , there are infinitely many and such that an instance in can be found linearly solvable over GF() but emph{not} over GF() with . On the other hand, the construction of also leads to a new class of multicast networks with nodes and edges, where is the minimum field size for linear solvability of the network.
Cited in
(2)
This page was built for publication: On Base Field of Linear Network Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976448)