Professional Documents
Culture Documents
3.1 (N, K) Linear Block Codes Over GF (Q)
3.1 (N, K) Linear Block Codes Over GF (Q)
3.1 (N, K) Linear Block Codes Over GF (Q)
from GF(q).
k
The linear (n, k) code over GF(q) is the set of q codeword of
By linear transformation
k −1
c = m ⋅ G = ∑ mi ⋅ g i =m0 g0 + m1 g0 + L + mk - 1 g k - 1
i =0
have rank k.
n-tuples.
Example:
that is,
1 0 0 0 1 0 1
0 1 0 0 1 1 1
G=
0 0 1 0 1 1 0
0 0 0 1 0 1 1
codeword is a codeword.
P matrix. That is
c i = mi ; for 0 ≤ i < k
k −1
c i = ∑ m j p j, n- k - i ; for k ≤ i < n
j =0
message codeword
( m0 , m1 ,L , mk - 1 ) ↔ ( m0 , m1 ,L , mk -1 , c k , c k + 1 ,L , c n-1 )
parity-check equations.
g0
g
G = 1 = [I k P ]
M
g k -1
where I k is the k × k identity matrix
M M O M
p( k - 1 ) , ( n - k - 1 ) p( k - 1 ) , ( n - k - 2 ) L p( k - 1 ) , 0
P -matrix is a k × ( n - k ) matrix.
Parity-check matrix
matrix H.
Let c = ( c0 , c 1 ,L , c n- 1 ) be an n-tuple
c ⋅ H T = (0,0,L ,0 )
14243
n− k
Since G = [I k P ]
[
we can see that H = P I n- k
T
]
where P T is the transpose of P
and G ⋅ H T = 0 .
Note: For any given generator matrix G, many solution for H are
possible.
Example:
1 0 0 1 1 1
G = 0 1 0 1 0 1
0 0 1 0 1 1
1 1 0 1 0 0
H = 1 0 1 0 1 0
1 1 1 0 0 1
generated by G.
u = ( u0 , u1 ,L , un- 1 )
v = ( v0 , v 1 ,L , v n- 1 )
n-1
d E (u , v ) = ∑(u
i =0
i - vi ) 2
d H ( u , v ) = { i | ui ≠ v i , i = 0,1,L , n - 1 }
(a) For a linear code C, the Hamming distance between any two
d H ( c 1 , c 2 ) = wt ( c 1 - c 2 ) = wt ( c 3 )
nonzero positions of c 3 .
(b) Triangle inequality
d H (a , c ) + d H (c , b ) ≥ d H (a , b )
a b
(c) d H ( a , b ) = wt ( a + b )
3.3 Minimum distance of a Block code
Let C be a linear block code. The minimum distance of C,
d min ≡ min {d ( v , u ) : v , u ∈ C, v ≠ u }
follows:
wmin ≡ min { w( v ) : v ∈ C, v ≠ 0 }
Exercise:
Proof:
d min ≡ min {d ( v , u ) : v , u ∈ C, v ≠ u }
= min { d ( v + u ) : v , u ∈ C, v ≠ u }
= min { w( x ) : x ∈ C, x ≠ 0 }
= wmin
3.4 maximum Error-Correction Capability of a Block
Code
Suppose that c0 is selected for transmission and that the closest
page 87)
c1
c0
c0
c2
c1
c r =c +e
e = ( e0 , e 1 ,L , e n- 1 ) : error pattern.
c = ( c0 , c 1 ,L , c n- 1 ) : codeword transmitted.
correctly.
d − 1
As a consequence, t = min is called the maximum
2
Error-detection Capability
word) is unreliable.
the code.
Hybrid modes of error control
i =0
Clearly, w0 = 1
w0 + w1 + L + wn = 2 k
Exercise:
code generated by
1 0 0 0 1 0 1
0 1 0 0 1 1 1
G=
0 0 1 0 1 1 0
0 0 0 1 0 1 1
Answer: W ( z ) = 1 + 7z 3 + 7z 4 + z 7
3.6 Some Commonly-used Modifications of Linear
Codes
Shortened code
Extended code
(or bits).
a (n+1, k) code.
be increased.
Punctured Code
bits).
rate is increased.