Matroidal root structure of skew polynomials over finite fields
From MaRDI portal
Publication:5030487
DOI10.1080/09720529.2019.1600845zbMath1501.16019arXiv1706.04283OpenAlexW2963891905WikidataQ127996106 ScholiaQ127996106MaRDI QIDQ5030487
Travis Alan Baumbaugh, Felice Manganiello
Publication date: 17 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04283
Ordinary and skew polynomial rings and semigroup rings (16S36) Finite fields (field-theoretic aspects) (12E20) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (2)
Recursive construction of normal polynomials over finite fields ⋮ Constructing featured supereulerian graph
Cites Work
- Unnamed Item
- Unnamed Item
- A new faster algorithm for factoring skew polynomials over finite fields
- Coding with skew polynomial rings
- Vandermonde and Wronskian matrices over division rings
- Factoring in skew-polynomial rings over finite fields
- Wedderburn polynomials over division rings. I.
- Theory of non-commutative polynomials
- Matroidal structure of skew polynomial rings with application to network coding
- NONCOMMUTATIVE POLYNOMIAL MAPS
- Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
- A Matroid Framework for Noncoherent Random Network Communications
This page was built for publication: Matroidal root structure of skew polynomials over finite fields