Matroidal structure of skew polynomial rings with application to network coding

DOI10.1016/J.FFA.2017.04.007MaRDI QIDQ2363334zbMATH OpenOpenAlexFDO

Authors Siyu Liu, Felice Manganiello, Frank R. Kschischang

Publication date 13 July 2017

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.07724

zbMATH Keywords

skew polynomial ringslinearized polynomialsmatroidal network coding

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Arithmetic theory of polynomial rings over finite fields (11T55)

Abstract: Over a finite field $mathbb{F}_{q^m}$, 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 $mathbb{F}_{q^m}[x;sigma]$-matroid, with rank function that makes it a metric space. Specific submatroids of this matroid are individually bijectively isometric to the projective geometry of $mathbb{F}_{q^m}$ equipped with the subspace metric. This isometry allows one to use the $mathbb{F}_{q^m}[x;sigma]$-matroid in a matroidal network coding application.

Recommendations

• Matroidal root structure of skew polynomials over finite fields
• Matroidal error correction networks and linear network error correction MDS codes
• \(q\)-polymatroids and their relation to rank-metric codes
• Rank-metric codes and \(q\)-polymatroids
• Some matroids related to sum-rank metric codes

Cites work

• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3367062 (Why is no real title available?)
• A Matroid Framework for Noncoherent Random Network Communications
• A Random Linear Network Coding Approach to Multicast
• A circulant approach to skew-constacyclic codes
• A general theory of Vandermonde matrices
• Coding for Errors and Erasures in Random Network Coding
• Coding with skew polynomial rings
• Finite-Dimensional Division Algebras over Fields
• Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
• Kötter interpolation in skew polynomial rings
• Linear codes using skew polynomials with automorphisms and derivations
• Network information flow
• Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
• Skew-cyclic codes
• Vandermonde and Wronskian matrices over division rings

Cited in

(6)

• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
• Codes in the sum-rank metric: fundamentals and applications
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Sheaf cohomology on network codings: maxflow-mincut theorem
• Matroidal root structure of skew polynomials over finite fields

This page was built for publication: Matroidal structure of skew polynomial rings with application to network coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363334)