All one polynomial
From Wikipedia, the free encyclopedia
|
|
The topic of this article may not meet Wikipedia's general notability guideline. Please help to establish notability by adding reliable, secondary sources about the topic. If notability cannot be established, the article is likely to be merged, redirected, or deleted. (March 2010) |
An all one polynomial (AOP) is a polynomial used in finite fields, specifically GF(2) (binary). The AOP is a 1-equally spaced polynomial.
An AOP of degree m has all terms from xm to x0 with coefficients of 1, and can be written as
or
or
thus the roots of the all one polynomial of degree m are all (m+1)th roots of unity other than unity itself.
[edit] Properties
Over GF(2) the AOP has many interesting properties, including:
- The Hamming weight of the AOP is m + 1
- The AOP is irreducible if and only if m + 1 is prime and 2 is a primitive root modulo m + 1
- The only AOP that is a primitive polynomial is x2 + x + 1.
Despite the fact that the Hamming weight is large, because of the ease of representation and other improvements there are efficient implementations in areas such as coding theory and cryptography.
Over
, the AOP is irreducible whenever m + 1 is prime p, and therefore in these cases, the pth cyclotomic polynomial.
[edit] References
| This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (July 2008) |


