|
|
|
|
all one polynomial
|
(Definition)
|
|
|
An all one polynomial (AOP) is a polynomial used in finite fields, specifically GF( ). The AOP is a 1-equally spaced polynomial.
An AOP of degree  can be written as follows:
Over GF( ) the AOP has many interesting properties, including:
Despite the fact that the Hamming weight is large, because of the ease of representation and other improvements there are efficient hardware and software implementations for use in areas such as coding theory and cryptography.
|
"all one polynomial" is owned by Derk.
|
|
(view preamble)
Cross-references: cryptography, theory, areas, representation, primitive polynomial, primitive root, prime, iff, irreducible polynomial, Hamming weight, properties, degree, finite fields, polynomial
There are 2 references to this entry.
This is version 4 of all one polynomial, born on 2005-02-05, modified 2005-02-09.
Object id is 6712, canonical name is AllOnePolynomial.
Accessed 2891 times total.
Classification:
| AMS MSC: | 12E10 (Field theory and polynomials :: General field theory :: Special polynomials) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
