Matroidal structure of skew polynomial rings with application to network coding
From MaRDI portal
Publication:2363334
DOI10.1016/j.ffa.2017.04.007zbMath1369.11090arXiv1610.07724OpenAlexW2541979517MaRDI QIDQ2363334
Siyu Liu, Frank R. Kschischang, Felice Manganiello
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items (5)
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ 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 ⋮ Matroidal root structure of skew polynomials over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A circulant approach to skew-constacyclic codes
- Coding with skew polynomial rings
- Skew-cyclic codes
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- Kötter interpolation in skew polynomial rings
- Linear codes using skew polynomials with automorphisms and derivations
- A Random Linear Network Coding Approach to Multicast
- Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- A Matroid Framework for Noncoherent Random Network Communications
- Finite-Dimensional Division Algebras over Fields
This page was built for publication: Matroidal structure of skew polynomial rings with application to network coding
