Composed products and factors of cyclotomic polynomials over finite fields
DOI10.1007/S10623-012-9647-9zbMATH Open1284.11157arXiv1109.4693OpenAlexW2047352316MaRDI QIDQ2391671FDOQ2391671
Qiang Wang, Aleksandr Tuxanidy
Publication date: 5 August 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4693
Recommendations
- On explicit factors of cyclotomic polynomials over finite fields
- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
- Explicit factorizations of cyclotomic polynomials over finite fields
- Factorization of composed polynomials and applications
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Recurrences (11B37)
Cites Work
- Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
- On explicit factors of cyclotomic polynomials over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclic Subgroups of the Prime Residue Group
- Products of linear recurring sequences
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Title not available (Why is that?)
- On irreducible polynomials of certain types in finite fields
- Irreducible compositions of polynomials over finite fields
- Explicit theorems on generator polynomials
- Bit-serial Reed - Solomon encoders
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Factors of Dickson polynomials over finite fields.
- Irreducibles and the composed product for polynomials over a finite field
- Factorizations of root-based polynomial compositions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- On the number of k-normal elements over finite fields
- Further factorization of \(x^n - 1\) over a finite field
- Recursion polynomials of unfolded sequences
- Factorization of Dickson polynomials over finite fields
- Irreducibles and the composed product for polynomials over a finite field
- An alternative product representation of cyclotomic polynomials
- Composed products and module polynomials over finite fields
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- Further factorization of xn − 1 over a finite field (II)
- Factorizations of root-based polynomial compositions
- A note on composed products of polynomials over finite fields
- Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x]$
- Explicit factorizations of cyclotomic polynomials over finite fields
- Normal bases and factorization of \(x^n -1\) in finite fields
This page was built for publication: Composed products and factors of cyclotomic polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391671)