Matroidal structure of skew polynomial rings with application to network coding

Abstract

Over a finite field Fqm, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew polynomials to the familiar concept of linear independence for vector spaces. This relation allows for the definition of a representable matroid called the Fqm[x;σ]-matroid, with rank function that makes it a metric space. Specific submatroids of this matroid are individually bijectively isometric to the projective geometry of Fqm equipped with the subspace metric. This isometry allows one to use the Fqm[x;σ]-matroid in a matroidal network coding application.