Ambadi, Niranjana (2018) Multicast Networks Solvable over Every Finite Field. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 236-240.
![]() |
PDF
ISIT_236_2018.pdf - Published Version Restricted to Registered users only Download (569kB) | Request a copy |
Official URL: http://dx.doi.org/10.1109/ISIT.2018.8437528
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.
Item Type: | Conference Proceedings |
---|---|
Series.: | IEEE International Symposium on Information Theory |
Publisher: | IEEE |
Additional Information: | IEEE International Symposium on Information Theory (ISIT), Vail, CO, JUN 17-22, 2018 |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 22 Nov 2018 15:03 |
Last Modified: | 22 Nov 2018 15:03 |
URI: | http://eprints.iisc.ac.in/id/eprint/61128 |
Actions (login required)
![]() |
View Item |