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
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… 
2017
2017
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive
The ZX-Calculus is a powerful diagrammatic language for quantum mechanics and quantum information processing. The completeness of… 
2015
2015
A Practical Key Exchange for the Internet using Lattice Cryptography
In [21], Peikert presents an efficient and provably secure set of lower level primitives for practical post-quantum cryptography… 
2014
2014
An infinite family of multiplicatively independent bases of number systems in cyclotomic number fields
Let ζ_k be a k -th primitive root of unity, m ≥ø( k ) + 1 an integer and Φ_k( X ) ∈ ℤ[ X ] the k -th cyclotomic polynomial. In… 
2012
2012
Flat Cyclotomic Polynomials: A New Approach
We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler… 
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… 
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… 
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… 
1957
1957
On the growth of the cyclotomic polynomial in the interval (0, 1)
Let be the rath cyclotomic polynomial, and denote by An the absolute value of the largest coefficient of Fn(x).Schur proved that… 
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)