Facts of LIFE
Ángela I. Barbero, Øyvind Ytrehus · 2007
The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a "real" network, through the use of a simulation model. We present results on the algorithm's ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.