Search results
Results From The WOW.Com Content Network
In finite field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(p m).This means that a polynomial F(X) of degree m with coefficients in GF(p) = Z/pZ is a primitive polynomial if it is monic and has a root α in GF(p m) such that {,,,,, …} is the entire field GF(p m).
A polynomial code is cyclic if and only if the generator polynomial divides . If the generator polynomial is primitive, then the resulting code has Hamming distance at least 3, provided that . In BCH codes, the generator polynomial is chosen to have specific roots in an extension field, in a way that achieves high Hamming distance.
The generator polynomial of the BCH code is defined as the least common multiple g(x) = lcm(m 1 (x),…,m d − 1 (x)). It can be seen that g(x) is a polynomial with coefficients in GF(q) and divides x n − 1. Therefore, the polynomial code defined by g(x) is a cyclic code.
Reed–Solomon codes; Named after: Irving S. Reed and Gustave Solomon: Classification; Hierarchy: Linear block code Polynomial code Cyclic code BCH code Reed–Solomon code: Block length: n = q − 1: Message length: k: Distance: n − k + 1: Alphabet size: q = p m (p prime) Notation [n, k, n − k + 1] q-code: Algorithms; Berlekamp–Massey ...
Download QR code; Print/export Download as PDF; Printable version; ... In different branches of mathematics, primitive polynomial may refer to: Primitive polynomial ...
It follows that composition induces a well-defined operation on primitive classes of discriminant , and as mentioned above, Gauss showed these classes form a finite abelian group. The identity class in the group is the unique class containing all forms x 2 + B x y + C y 2 {\displaystyle x^{2}+Bxy+Cy^{2}} , i.e., with first coefficient 1.
The Conway polynomial C p,n is defined as the lexicographically minimal monic primitive polynomial of degree n over F p that is compatible with C p,m for all m dividing n.This is an inductive definition on n: the base case is C p,1 (x) = x − α where α is the lexicographically minimal primitive element of F p.
The following table lists examples of maximal-length feedback polynomials (primitive polynomials) for shift-register lengths up to 24. The formalism for maximum-length LFSRs was developed by Solomon W. Golomb in his 1967 book. [ 10 ]