GRS-example - A GRS decoding example Consider the code...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
A GRS decoding example Consider the code GRS 10 , 4 ( α , v ) over F 11 with α = v = (10 , 9 , 8 , 7 , 6 , 5 , 4 , 3 , 2 , 1) , hence (by direct calculation or Problems 5.1.3/5.1.5) we may take u = (1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1) . Note that here r = 10 - 4 = 6, so we can correct up to r/ 2 = 3 errors. We wish to decode the received word p = (0 , 0 , 8 , 0 , 0 , 2 , 0 , 0 , 7 , 0) . First calculate the syndrome polynomial: S p ( z ) = 10 X j =1 u j · p j 1 - α j z = 1 · 8 1 - 8 z + 1 · 2 1 - 5 z + 1 · 7 1 - 2 z (mod z 6 ) = 8( 1 +8 z +9 z 2 +6 z 3 +4 z 4 +10 z 5 ) +2( 1 +5 z +3 z 2 +4 z 3 +9 z 4 + z 5 ) (mod z 6 ) +7( 1 +2 z +4 z 2 +8 z 3 +5 z 4 +10 z 5 ) = 6 + 0 z + 7 z 2 + 2 z 3 + 8 z 4 + 9 z 5 . We now (partially) calculate gcd( z 6 , 9 z 5 +8 z 4 +2 z 3 +7 z 2 +6) = 1 over F 11 , the Euclidean Algorithm example discussed in class (and on a handout). In our Euclidean Algorithm example, Step 3, where r 3 ( z ) = 10 z 2 + 5 z + 7, is the first step j for which the degree of r j ( z ) is less than
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

GRS-example - A GRS decoding example Consider the code...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online