差错控制编码解决加性噪声 第15页
and so
Remark:There will be a unique polynomial such that . When thinking of the codespace as a product of polynomials with instead of the row space of a binary matrix, this polynomial will take the place of the check matrix in the decoding process. Let be a codeword then
Then if degthe coeffiecients of the highest powers match the coeffiecients of the lowest powers of x in the polynomial .
Further, if the generating polynomial has degree
and we can realize a code word as an information sequence times the matrix
mod
As stated before, we can treat the polynomial
Lets now consider an example using a
Because each of the three rows are linearly independent we know from linear algebra that the row space of the matrix is a 3-dimensional subspace of
It turns out that in this case all the cyclic shifts of the first row vector account for every vector in the row space. Thus we have a cyclic code and the generating polynomial is
which corresponds to the first row of the generating matrix.
Also, and so the check polynomial is
and we get the following check matrix
Now taking the codeword corresponding to we get
mod
In fact, for every codeword
<< 上一页 [11] [12] [13] [14] [15]