Multicast Networks Solvable over Every Finite Field
Information Theory
2018-05-10 v1 math.IT
Abstract
In this work, it is revealed that an acyclic multicast network that is scalar linearly solvable over Galois Field of two elements, GF(2), is solvable over all higher finite fields. An algorithm which, given a GF(2) solution for an acyclic multicast network, computes the solution over any arbitrary finite field is presented. The concept of multicast matroid is introduced in this paper. Gammoids and their base-orderability along with the regularity of a binary multicast matroid are used to prove the results.
Cite
@article{arxiv.1805.03625,
title = {Multicast Networks Solvable over Every Finite Field},
author = {Niranjana Ambadi},
journal= {arXiv preprint arXiv:1805.03625},
year = {2018}
}
Comments
7 pages, part of content of this manuscript accepted for presentation at International Symposium on Information Theory (ISIT), 2018