7 encoding Flashcards

1
Q

example 7.1
Let C be 3-ary and generated by
G =
[10010
01010
00102]
Encode the messagewords 000, 101 and 122.

A

000 → 00000, so we need
101 → (101)G = (10112)
122 → (122)G = (12201)

first three digits from this G give messageword digits
because G is in standard form

also the other digits are check digits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

why do we want G in standard form?

A

messageword encode
→ codeword transmit(noise) → received vector
project → nearest codeword interpret → decoded messageword

then drop the check digits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

For a given linear code C over F_q

(ie subset of F_q ^n for some n) generated by G we have a natural identification between C and F_q ^k
k=dimC

A

each x ∈ C is uniquely expressible as
x =Σ aᵢ vᵢ for i=1 to k

(the vᵢs are the rows of G in the natural order).

So
x ↔ (a1, a2, …, ak ) ∈ F_q ^k
is a one-to-one correspondence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

using G for messg words

A

We think of the a = (a1, …, ak ) vectors as the message words of
the code, and the n-tuples x as the codewords representing them.

Note that the encoding map
a→ x : F_q ^k → C
is then simply

x = aG
That is, right multiplication by the generating matrix — a linear map!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly