Professional Documents
Culture Documents
(一)
C = [c0, c1,…, cn-1 ]
Hamming (7, 4) code
1 0 0 1 0 1 1 Z 1
0
CHT = [0, 0, 0] – over GF(2)
H 0 1 0 1 1 1 0 Z CHT = 0 – in GF(23)
0 0 1 0 1 1 1 Z 2
1 0 1 0 HCT
α=Z
c0 0 +c1 1 +...+c n-1 0 = 0
=[0,0,0]T
α 2 = Z2
0 0 1 0 α3 = Z + 1
α4 = Z2 + Z
GF8 GF2Z
α 5 = Z2 + Z + 1
Z3 Z 1 α 6 = Z2 + 1
α7 = 1
2006/12/6 Yuh-Ming Huang, CSIE NCNU Block Codes - extended 1
take the primitive element z
H α 0 α1 α 2 α 3 α 4 α 5 α 6
6 n 1
ci 0 c x ci x
i i e.g. c(x)=1+x+x3
i 0 i 0
i 0
Def: Let GF(q) be a field and let GF(Q) be an extension field of GF(q).
Let β be in GF(Q). The prime polynomial f(x) of smallest degree
over GF(q) with f(β) = 0 is called the minimal polynomial of β over
GF(q).
x15 – 1 = (x+1)(x2+x+1)(x4+x+1)(x4+x3+1)(x4+x3+x2+x+1)
取 g(x) = (x4+x+1)(x4+x3+x2+x+1) = x8 + x7 + x6 + x4 + 1
(i) n – k = 8 k = 7
(ii) d* ≤ 9 (= singleton bound)
≤ 5 (∵ w(g(x)) = 5)
∵ d* ≥ 2t + 1 = 5 (BCH bound)
∴ d* = 5
Q:
1. Find the parity check matrix H?
2. Using the generator polynomial g(x), first find a codeword and
then check whether the equation CHT=0 holds ?
Q:
1. What’s the parity check matrix ?
2. How could we see that c(x) has zeros, α, α3 and α5 ,
from the property of cHT = 0?
f l x
minimal
βj
polynomial
Def: Two element of GF(qm) that share the same minimal polynomial
over GF(q) are called conjugates (with respect to GF(q))
GF(24)
e.g.
GF(16)
q=2 r=4 m=4
GF(42)
2 2 2 2 3
2 r-1
{β, βq, βq , … , βq } βq = β
r α7 (α7) (α7) (α7)
n = 2m – 1 = 24 – 1 = 15
4
ie. β2 = β
Thm: The minimal polynomial of β is ie. β15 = 1
r-1
f(x) = (x- β)(x- βq)…(x- βq )
m m
Cor: ∵ βq = β(βq -1 = βn = 1) -> r< m
∴ deg( minimal polynomial ) ≤ m
2006/12/6 Yuh-Ming Huang, CSIE NCNU Block Codes - extended 10
Thm1: Let g(x), the generator polynomial of a primitive code, have zeros
β1, β2 … βr in GF(qm). A polynomial c(x) over GF(q) is a codeword
polynomial iff c(β1) = c(β2) = … = c(βr) = 0, where c(βj) is evaluated
in GF(qm).