home *** CD-ROM | disk | FTP | other *** search

---

/ Developer Source 3 / Developers_Source_Vol_03_1996.iso / dobbs / dec94 / cann1t4.gif

< prev

next >

Graphics Interchange Format  |  1996-06-12  |  97KB  |  499x663  |  4-bit (16 colors)

Labels: text | screenshot | diagram | font | number | parallel
OCR: Suppose: (15,5) - binary BCH code with g( D) = D" + D8 + D3 + D+ + Dª + D+1 x(D) =0 -> all - zeros code word transmitted 3 errors occur at positions 2,5, 14 -> y(D) = D14 + D5 + D2 Then syndromes: Si= y(x) = 07 S2 = y(a2) = a14 S3 = x SA = 013 Ss = Q10 Algorithm at work: o(D) Output Sequence Comment 0(D) =1 0 Cannot produce S, 0x2 = a =S Cannot produce Ss S.S ., a =S. a= s ., 0=Ss Cannot produce Ss S1, S2 .S. , SA a =S ,, a = S; Okay, so: error locators O(D) = 1+ a D+ a'D2 + aD' = (+ a'D)U + a D)(1+ a D) Table 4: Massey-Berlekamp algorithm in progress.

---