Pages that link to "Item:Q2447801"

The following pages link to Explicit factorization of \(X^{2^m}p^n-1\) over a finite field (Q2447801):

Displayed 19 items.

• Weight enumerator of some irreducible cyclic codes (Q256579) ‎ (← links)
• Enumeration formulas for self-dual cyclic codes (Q324259) ‎ (← links)
• Some minimal cyclic codes over finite fields (Q397163) ‎ (← links)
• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\) (Q499673) ‎ (← links)
• Explicit factorizations of cyclotomic polynomials over finite fields (Q517278) ‎ (← links)
• The minimum Hamming distances of irreducible cyclic codes (Q740312) ‎ (← links)
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) ‎ (← links)
• Primitive idempotents of irreducible cyclic codes of length \(n\) (Q1721319) ‎ (← links)
• Further factorization of \(x^n - 1\) over a finite field (Q1800700) ‎ (← links)
• On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials (Q2031633) ‎ (← links)
• Factorization of Dickson polynomials over finite fields (Q2107676) ‎ (← links)
• Some special cyclic codes of length 2n (Q2958466) ‎ (← links)
• Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x]$ (Q4997209) ‎ (← links)
• Further factorization of xn − 1 over a finite field (II) (Q5025145) ‎ (← links)
• (Q5038389) ‎ (← links)
• The minimum Hamming distances of the irreducible cyclic codes of length (Q5069838) ‎ (← links)
• Explicit factorization of xl1m1l2m2l3m3−a and <i>a</i>-constacyclic codes over a finite field (Q5097411) ‎ (← links)
• On the number of k-normal elements over finite fields (Q5743018) ‎ (← links)
• A class of minimal cyclic codes over finite fields (Q5890958) ‎ (← links)