A generic linear network (GLN) code is the strongest linear network code in terms of the linear independence of the coding vectors. It can be designed by constructing a representation matrix for a transversal matroid. Recently, a new algorithm for constructing this matrix has been developed. In this letter, we present details on the method of constructing a GLN code using transversal matroids, compute the time complexity of this method, and compare it with other algorithms.
['Morteza Rekab-Eslami', 'Morteza Esmaeili', 'T. Aaron Gulliver']
Generic Linear Network Code Construction Using Transversal Matroids