In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator polynomial).
Definition Fix a finite field G F ( q ) {\displaystyle GF(q)} , whose elements we call symbols. For the purposes of constructing polynomial codes, we identify a string of n {\displaystyle n} symbols a n − 1 … a 0 {\displaystyle a_{n-1}\ldots a_{0}} with the polynomial
a n − 1 x n − 1 + ⋯ + a 1 x + a 0 . {\displaystyle a_{n-1}x^{n-1}+\cdots +a_{1}x+a_{0}.\,}
Fix integers m ≤ n {\displaystyle m\leq n} and let g ( x ) {\displaystyle g(x)} be some fixed polynomial of degree m {\displaystyle m} , called the generator polynomial. The polynomial code generated by g ( x ) {\displaystyle g(x)} is the code whose code words are precisely the polynomials of degree less than n {\displaystyle n} that are divisible (without remainder) by g ( x ) {\displaystyle g(x)} .
Example Consider the polynomial code over G F ( 2 ) = { 0 , 1 } {\displaystyle GF(2)=\{0,1\}} with n = 5 {\displaystyle n=5} , m = 2 {\displaystyle m=2} , and generator polynomial g ( x ) = x 2 + x + 1 {\displaystyle g(x)=x^{2}+x+1} . This code consists of the following code words:
0 ⋅ g ( x ) , 1 ⋅ g ( x ) , x ⋅ g ( x ) , ( x + 1 ) ⋅ g ( x ) , {\displaystyle 0\cdot g(x),\quad 1\cdot g(x),\quad x\cdot g(x),\quad (x+1)\cdot g(x),}
x 2 ⋅ g ( x ) , ( x 2 + 1 ) ⋅ g ( x ) , ( x 2 + x ) ⋅ g ( x ) , ( x 2 + x + 1 ) ⋅ g ( x ) . {\displaystyle x^{2}\cdot g(x),\quad (x^{2}+1)\cdot g(x),\quad (x^{2}+x)\cdot g(x),\quad (x^{2}+x+1)\cdot g(x).}
Or written explicitly:
0 , x 2 + x + 1 , x 3 + x 2 + x , x 3 + 2 x 2 + 2 x + 1 , {\displaystyle 0,\quad x^{2}+x+1,\quad x^{3}+x^{2}+x,\quad x^{3}+2x^{2}+2x+1,}
x 4 + x 3 + x 2 , x 4 + x 3 + 2 x 2 + x + 1 , x 4 + 2 x 3 + 2 x 2 + x , x 4 + 2 x 3 + 3 x 2 + 2 x + 1. {\displaystyle x^{4}+x^{3}+x^{2},\quad x^{4}+x^{3}+2x^{2}+x+1,\quad x^{4}+2x^{3}+2x^{2}+x,\quad x^{4}+2x^{3}+3x^{2}+2x+1.}
Since the polynomial code is defined over the Binary Galois Field G F ( 2 ) = { 0 , 1 } {\displaystyle GF(2)=\{0,1\}} , polynomial elements are represented as a modulo-2 sum and the final polynomials are:
… excerpt ends here. Continue reading the full article.
