Skip to search formSkip to main contentSkip to account menu

Cyclotomic polynomial

Known as: Cyclotomic polynomials, Cyclotonic polynomial 
In mathematics, more specifically in algebra, the nth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
All one polynomialCoefficientDiscrete Fourier transformEisenstein's criterion

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Block Structure of Cyclotomic Polynomials
In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by… 
2017
2017
Four classes of linear codes from cyclotomic cosets
This paper presents four classes of linear codes from coset representatives of subgroups and cyclotomic coset families of certain… 
2015
2015
Alternating quiver Hecke algebras
Review
2013
Review
2013
On the coefficients of cyclotomic polynomials
The nth cyclotomic polynomial Phi_n(x)is the minimal polynomial of a primitive nth root of unity. The order of \Phi_n is the… 
2010
2010
A symbol-reliability based message-passing decoding algorithm for nonbinary LDPC codes over finite fields
Based on the idea of plurality voting, we develop a low-complexity symbol-reliability based message-passing decoding algorithm… 
2008
2008
Calculating cyclotomic polynomials of very large height
We present two algorithms to calculate n(z), the nth cyclotomic polynomial. The rst algorithm calculates n(z) by a series of… 
2007
2007
Reciprocal cyclotomic polynomials
Let $\Psi_n(x)$ be the monic polynomial having precisely all non-primitive $n$th roots of unity as its simple zeros. One has… 
2006
2006
Cyclotomic polynomials with large coefficients
The coefficients a(m,n) and especially A(n) and S(n) have been the subject of numerous investigations (see [1] and the references… 
1999
1999
Cyclotomy and cyclotomic polynomials
As these n points on the circle are also the corners of a regular n-gon, the problem of cyclotomy is equivalent to the problem of… 
Highly Cited
1997
Highly Cited
1997
Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields
We show how to use cyclotomic polynomials to construct subgroups of multiplicative groups of finite fields that allow very… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)