Revisiting the linear information flow algorithm
by Russell Higgs
International Journal of Information and Coding Theory (IJICOT), Vol. 2, No. 2/3, 2013

Abstract: In this short paper, we reprise a geometrical proof of the deterministic linear information flow algorithm for a multicast network. Each time this greedy algorithm is run, it can always construct a linear network code from the underlying graph, provided the alphabet used contains at least as many elements as the number, n, of receivers in the network. Our proof actually shows that this lower bound can be reduced to the maximum number of receivers any coding point is connected to along the chosen disjoint path sets. The main result we give is to show how greedy the algorithm can be by giving an example of a network graph with n receivers, that needs an alphabet of size n to implement the algorithm for each n ≥ 2, but which in reality only requires a binary alphabet.

Online publication date: Sat, 13-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com