کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5771664 1630357 2017 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Matroidal structure of skew polynomial rings with application to network coding
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Matroidal structure of skew polynomial rings with application to network coding
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 46, July 2017, Pages 326-346
نویسندگان
, , ,