Matroidal root structure of skew polynomials over finite fields
DOI10.1080/09720529.2019.1600845zbMATH Open1501.16019arXiv1706.04283OpenAlexW2963891905WikidataQ127996106 ScholiaQ127996106MaRDI QIDQ5030487FDOQ5030487
Authors: 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
Recommendations
- Matroidal structure of skew polynomial rings with application to network coding
- Theory and applications of linearized multivariate skew polynomials
- Non-commutative Hamilton-Cayley theorem and roots of characteristic polynomials of skew maximal period linear recurrences over Galois rings
- Factor rings of skew polynomial rings over a finite field
- Algebraicity in local rings.
Combinatorial aspects of matroids and geometric lattices (05B35) Finite fields (field-theoretic aspects) (12E20) Ordinary and skew polynomial rings and semigroup rings (16S36)
Cites Work
- Factoring in skew-polynomial rings over finite fields
- Theory of non-commutative polynomials
- Title not available (Why is that?)
- Coding with skew polynomial rings
- Title not available (Why is that?)
- Wedderburn polynomials over division rings. I.
- Vandermonde and Wronskian matrices over division rings
- Noncommutative polynomial maps.
- Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
- A new faster algorithm for factoring skew polynomials over finite fields
- Matroidal structure of skew polynomial rings with application to network coding
- A Matroid Framework for Noncoherent Random Network Communications
Cited In (5)
This page was built for publication: Matroidal root structure of skew polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030487)