BCH (Bose-Chaudhuri-Hocquenqhan) Codes Cyclic codes, Generalizations Hamrning of Codes

,.r_,1t.... ,,''',1.!
n'.r

Prooerties For oositiveintegers ) I . i < 2' I : m Blocklength Parity ckeckdigits Minimum distance : Hamrning codes t: i, dm,n 3 : : : : , n:2^-t n-k: mr d*i" : 2t-l ( ,.-r tl r .f , " - l

l,,,aa o 3' .^lo I ' .,. ,. L\lL / .-. rfo.r.'! "" r ,,,'r

,q,.,t l,o)

i' . t

'-,
oenn 67 I -)

Gn")

poll,nomialspecilied termsof roorsliom GF(2''). Generator in

Defrnition: g(x) oft-error corrccting BCH code,lensth2--l is the lowest degree polynomialover GF(2) ,,vhich cr,ct),u.2, . .. gr'.asits rootswhen u has . ;''";" i primitiveelement GF(2"') is a in [ir , .e i ; a,+e cl{t) 9l,n'a ,2t I i )r I 'tl', i . e ,g ( a ' ): 0 : ) '.L e t$ , ( x )b e t h em i n i m . rp o l ; : t r r . , - ru.;: " l i :
'//

g(x) : LCNI{d,(r),0,(x),....ri,,,(x)l Consider now i - eveninteqer. ." i: i'2' i ' - o d d o .l : l n ;

... .'.

\]'1

r^'

l"t'

rLn

| ') 'r _ |

.) tt,tl

rl.,(- /,

: cr.i o i'z' = (o i )r' = ui is a conjugate a, . of d', cr' havethe sameminimalpolynomial, $,(x): $,.(x) i.e.

.'.

g(x)= LCM{0i(x), 0;(x),...,0",,(x)}

= degree ofg(x) 5 mt

"?,?',")i' .'

DegreeofQi(x) < m (n-k) < mt +

Minimum Dstance of Code . l Any codepolynomialc(x): cn+ c1x+...; c,-,xn : a(x)g(x) cr, cr2,..., cr2t and their conjugates roots ofc(x). are
t-3

ifa polynomial y(x) has a, crr, .... crr'asroots then y(x) is dirisible by g(x) :

LCM{{1(x), 0,("),...,0"(x)}.
:> .. .. y(x) is a codepolynomial. c(x) is a codepolynomial iffit hasa, cr2, o.:'asroots..,, c ( o . ' ) : 6 , , + 6 c r + c r ( c [ ' ) 2 + . , + c "r ( s i ; ' r : g ' i I cr'
or [ c a c ; c 1 . . . c n1 ]

L(r' l'=0,
| A(n )\

l<i<tr

matrix; Consider
il ,. ,art o t .......-.. l cJ.u

i
H:

r:r, (",I

6,1

(",).,

L' o" (q''I 6''1. .

> .',

6"I

cHr :0 for anyc e C + BCHcode. H is thepariry check matrix. is If cC a conjugates ofa'then c(d) : 0 iffc(cr'): 0. Write H as
1 ct d.' s3
trn'

1 crr
H:

("'I

r ..,i (",I
I c{.2'I (""'I

6,i

6,)-'

6'1
6'.,1. . ..,

0,I'
(.,' *r)'r

74

omit rows ctr o": (0.), a- : la, )_ To prove daa > 2t+1 zqq

ot : (ctt)' o",: (o,).

needto show that no 2t (or lewer) columnsofH sum to

Proof: Suppose (c0.cr, c:, ...,cn1)non-zero c: cotlevectorweightv 12t. L e t c r , , c r , , . . . . , c J ,t h e n o n z e r c o m p o n e n 0s1 . 1 p ! n - 1 .T h e n o be t

6'I
cHr: 1c,,,c,, l u ,....,c,,
I x v matnx

("''I
("")' ("")'

("'l'
(" ')"

l'.^-"'
I

: [0]'
(l

(q')
(," ',)"

('' t'
("')'

L'r,.,,

' ' ' ' ' ' ' "J , ll

t1

l r " IA

("'i'

6'i'

v x \ mat]x r "h o s e e t : 0 d

")

o. (o' o:' ... I o;'

[:,":1
6,'I 6',)'
6'l'
(-) / 75

Vandermonde Matrix

Aside VandermondeNlatrix

xr

x.
tv rr \-t/

.._ x,,
... f^I / t u

(x,)'

(pxp)

( x , ) u - '( r , ) u ' . . ( x u ) , '

has a nonzero determrnant iffall of the X aredistinct.

X =\ Proof :

tir,ocolumns samc--r det : 0 obl ioLrs l,)

I f b y induction(only ii True l o r _ -

',

n titlttx,

f . , 1 .A s s i r r nfe u cf o r ( u i ) x ( u - l ) \ . a n d e r m o n d e '\ ' L^L Let X1 be replaced x {r'aneblc). bv

. [ r r ]

t
Then.D(x) : det

X,

(x,)t

.... (,r,t' ' ]

-r

Xu

(""I

I (,r,)' ]
.i
: -,,

Ilxoand in termsof the l '' row.

* D 1 x =1 i d r x i c : r - . . . du,r xp-l . 6

,(r 5'""
r. 'r. "o,lr

:^'
t

1
,/

'' t-t

1.", )(, ,:',

(r.)'
XF

. . . .( r . ) u '

(r-I

(x"I'

Iix : X1, 2 <i < V, thenD(X,): 0 ('l r',.o rows are same),i.e., thesept-I of rhem. [r' I

= D(x) du_11 - x, ) | ll(.

L r=l

i6

1 '.:t

r\

D(X,) + 0. i.e.. the dererminanr VandermondeMarix ; 0 of iix=X1 =X,.2<i<u. , (*) = determinantof Vandermonde Matrix : 0 contradiction .. Y> 2t+2 ed diste CH code.

2t+ I is calle

d..-rnay lg']arycr.

.tr\amDte

.:2tI 15: t:z Nijed to useGF(2r)and tind g ( x ) : I - C \ I l d l ( x ) .d r ( x ) .i f . ( x ) ,0 . , ( x ) l

+, . 1 , 1

ll'

il'

fi'

l a \ l i o . r \ ' . . or : r\ : (x-- x- 1)( x-- x'; x--x+ I )

t a , xt+ xo+-'_t ]
l : ' F : /

FIar a ( i 5. 7) cr clic BCH coderrirh an enor correctinrcapabilirl. 2. c of * Noie :n. t arespeciiied: k-follows.

Generaliy A BCII cycliccodeis defined follorvs:Choosc m and p anv as , q, element GF(q-) oi ordern. Thenfor anypositiveinteger and integer rhe of j0. r generator pol),nomial BCH cycliccodeofblocklength is givenby ofa n

g(x)=LCM (.),i;"_,(*)....,0,".., t0;. ,(')l

$n(r)is theminimalpolynomial &. of

71

?CZ

D e,"r.

c ' i{hm.

a{

BLH

Cid"--'.t

a EC-- (1_:_,.,) core_:rrr-: crie _a_,:_1-:. fual x r t .rir,ri:_eroi - r - r - . I _ i . =.\- x-- a -g r-::::-t"' lri pol,",tot:.all r c - : -: .:'- : ' . .ihd= is ri:r) '.t. ii" --o, lr..,o. pui,rr".lr.i
eiToa.
).liL!!lO!'\

A.."'Ai"g
5.-i t- - 3
r (
I L (
I - j

io
,

Caie n

S"..- q h

t,

t , ' Y tt -- - cr CcG qf,)

'i lte r.

(
" 5 <

< .
-< .

M=l.t -'

-'J
t. I

=l't=

i -i

,r

{?J

.J

'/t

"(,^-: ,

i , r .L
.: -.
-:

I s

\ .
-'.

{ ,

' ^ " ,

'.J
.ir

l = I
-- *

ft1 )

. .:* -:C

t _
o

J .]
. t . C

1'-'---

"11a'

...".--: ! r"\ ) -

, L

i
3

- _

L6
.l
i.-

i " L- ,l :l - n ' \ - s : l r I

l -r' (-" | L
rJ

i-s ) +
,61 ! i

I
.< I 1 - l

= l-"6,+JL-.1- t f . r "-. ' ( -1

L--

t t' r ?\ -

I + .,.1 | '. 1
l.r+". I L"- J

./-

t
.- ^ i'.^'. i:1 i
, : : -

l'!

a x) :
4 l E > 1

- _ t ' ( - + l- ,\^tr- f^\-a j

. J

'

; - J

)
j . I Sc!\! Si !

, h - - * :

l
'

.
,

l
, Y \

r.cc6{G.\^...J

n'

J '

e^-A-

cl

l\--

^r.'^p-<rc {

}* ri,
,{\r
!!vr!

n ^.al

c{'"^-1:$^.r-...,tr.
t\,.e { {OY

ys!',.r-^'*(
( ^ "

>/t

r,.LG'* ; . i r
cc-) 9ee

1ei.L.t 1

Lct: t1..1"...{ v - \ ) / : s - 5 1 : \ 'r '-,= : S . r r', =o ,.t _.'l-.. a.o , P:3i

tb:'

to
' ,

. - )

-. :

i)

\ S r, 1. , rt * J = \ , , . , . * r, jI * t? ! . , l ,! L;L

t. t.

S,

\.5

*,o Ja.

c4,,r

I t-. t
Lt.
t+/ t

c r ,\J,j

.f
1
-

,lL- r

' J' l " l . -

;t ;l=1,

C ':-c\

t"t i: : < -

It

:r+r)

b !"-. a. J tl

'. :ia L

t/t

Reed-SolomonfRS) Codes BCH codesrvherethe block lenslh. n. divldesthe mulriplicative orderof the s)'rnbol alphabet, m : 1. i.e., 3 Symbol lield GF(q) and extensionfield GF(q-) are the sameas m:l and n:9_ I x-B.

Minimal polvnomialover GF(q)of element in the samcCIF(q) {(x): is B A1l minimal polvnomials linear. arc .. g(x) (x-a)( -ur).....(x-(]:r'l \ nk 2t

g(x) hasdeeree = 2t

Theorem Reed-Solornon coile is a nra.rinrum distance coderirh mininruntcirstance n d=n-k+1. Proo.f L e t d - 2 r - l b c t l c s r g n e ds t a n c e 1 d : J t . l = = n - k di d-

isrnLclt ,rk.

But d" S n-k+ I ior arl lincarcode(Singleton's tsound)

'' E x a m p l : R c e d - S o l o mc o d e s e on C h o o sG F ( 1 6= q : 1 6 e ) n:q- l: I5 (blocklength) a) Chcoset=2 . . (15,I l) code

"='te it - a - l k=l t

ta)a

' icat'

2t=1 - > n-k=2r1, R:0.73

g(x) : (x- c)(1+61t11x+crr;1x+co;

: a.+ qir,*l: g611;gi1;1rlo

Codetakesa binarybit stream (informatron): blocksir into blocksof4, maps1l blockswhich arerepresented in hex into 15her s_vnbols. norv

7t

ll Encoderilp
--,,i____tt____l \

4 binarysymbol I hex s1.rnbol. = I Encoder olp

1 1h e x + 4.1bits >
b)

2 . . . . . . . . . . . . . ,5. . . 1.

- - - - - - . - l l - - - - r l . -.--'llcx : - \. .I' svmhols

1 5h e r 60 birs 2t--6 = q-k:6.k-9

Fi

..

( 1 5 , 9 )c o d e : k : n : 0 . 6 R g(r) : (x-cr){r-crr 1ix-cir)1xr-'1 , {x+ftj)({+crr') - . 1 x l - o - l t x l o . t x t: c r l . - u " ' ) ( x t - a t x + a / ' , )

: tr6- "ii-tr-tl',\.: 11:1,- q_:1r-or.a..,rtL'

Encoder ir'p 9 FIex l6 brts

l-i llcx 6 { )b i l s

P eters on-Gorenstein-Zi eler D ecod et element Received vectoris R(x)=c(x)+e(x)

I I e ( x ) : e " 1 x " - e n" 1 n + . . . . ' . s , 1 - s , ,

lr'heret or fewer coelflcientsare nonzeros. Assumev S t errorc ccur in locations i2,....r,. i1, .. e { \ ) - e .x ' ,+ e , x -.... e \'
- /

+ magnitude error (:
>

ilo.'
n r t

It,
l t t

t
l

ti.,,,

,..

i for binarycode)

W el a n o rc ( a i ): 0, i = l , 2 , . . . , 2 t v
R ( o , ' ) :e ( c ' ) i, : l , 2 , . . . , 2 t

..9

Compute these2t s].n&omesliom R(\) / \ i . e S - R r u r c , . l oI , e , . t o ' iDefine ! : e,,, .. X/ : rr', <

. (")

errorlocator number

S , : Y 1 X ' r+ Y . 1 1 "a . . . p Y , a . r t

Thus have2t eouations 2v unkno$ns in

S ,: Y ] X 1 \ ' r x r - . . . - Y , X , S : : \ ' i X . :+ Y : X : l- . . . y , X , ' I

S : ,: \ ' r \ t' y,X.t,- ... t y,X,:,

haveat lcast I soiutionrvhichl s unique

D e t i n . \ ( r ): I l - r \ ) ( L \ \ : ) . . . ( l - x - \ . ) e
: -\,x -.. ., -1.1 1 e - o r - l o c l t o rp o l r . n o n t i r l ) .\. r'

0 : \ . / X ,'r( t , . \ L \ , , , . \ r \ / , , . _ . t \

' Y r [ X ' r - , \ 1 . \ 7 j "I + . 1 . 5 . r ' ] ' . . - : \ , \ r r l

True ibr each1.i:

T rr
tt

. \ : \1 x/
L=l

...rr,l rr ,,
/=t

:S,-" '

:Sr- r

:Sj

A ' S , , -r + A : S r , : - . . . , - A , S j : - S r r ,,.j : 1 , 2 , . . . , v syndromes known. In matrix form are

Ifj 5 v

sr s.
S . Sr S.

Sr
Sr

. . .s . . , s .
''' S" S'*r

_ S,_r S,,

s,*r s",, ... .s,,,

sr,,

- s,,
find zerosof

Thus ifmatrix is non singular,we havesolutionfor A(x) ... ,\(x) to get error locations.

SO

Consider

S, }I: lS.

ft,

t.

s.
s.

... s i
... s, .. S,,,,

s"
Su-r S,,-,

t ' S"-, S' . LSu

Claim d e t l N l+ 0 i f r i l !!!!

r::Cifp>r

L gi

: 0. i-t-. ., {r' errorsoccurred) 1 i

lr
Xl {
i(.
(\ )

X.
i\. il

(X ) )

x,, (.r I

" .j n
Llr

[t'-t

. .

Y,X- ... 0
ll
\'.\.

(\.

)'

X,

fi = \'\ a.

or. l. r=l

detlMl: derlA]detfB]derfA]
det[A] + 0 (Vandermonde Matrix) if p : v d . t l B l , U r V a n d e r m o n d ea r i x ' )i f p r v M

lfu>r'

detilf, t! :l
: Y, (LL>r,-) 0

detlM]: 0

DecodingAlgoithm i) Find the correct valueofv. Setv:t finddetlM]:0?

No, thenr=-t Repeat. Clontinue until det[Nl]+ 0

2)

r)

No. oferrors kno*1. I n r c n ) I C o m n ' r - r\ 1 1 ) Find zerosof :\fx) iirr findingeror locarions Do this simplybv trial Xt. and eror (Chiensearch) thenerrorr ectorknor otherulse magnituclcs. (iomnute eror maSniiuries ljom

[r,
(\ l j )-

\.

'''

\ , )

(\.)

. i \
.... (\

l i v tl
\',,

l(\ )'

(\,1
,,

:\,1

il,l i,]

kro\\n []3tn\. tirctor-\1. \.. .. . \ a Vandeimondc natrix. = det;0 -

oLtioi eachcolumn to show that li rs

soile ibr \'1. Y:. ..., \', bv inr..ertrng it.

S]

Berlekamp-ryIessey -{lgorithm for Decoding ]BCII Codes) Syn&omes related follorvs: are as
q:Lr s

j:r'-l. v+1...., 2r'

error locatoroolr.nomial coeffi cienrs Above is an autore,qressive rvith coefficients.\. . ....r,. Generatecl filter i:l bv

i<-...,.....:..

<-r

a6
Problem : Desigrt smaiiesr hnear-iiedback rccister thatrvill produce klonn sequence s.,lldromes. ol = A(x) is oismallesrdegiee- v only one, sinceoriginal.solLrtion was unique.

If syndromes represent colTectable a elTorpattemthenrishtnost tap "+0. To designthe shift resjsterneedto deterrrrine 1) L - shift regrsterlength 2) A(x):A,x'+,t,1x''r+........+1,1+1 Feedbackconnecrion pollnomial DesignProcedure- Inductive Assumewe have desigled a seriesof shili registers.

(t,, A(')(") ) (t-., ,t(t)(t<) )

{Ll, : fi 1\'tX) ' A(tr|)/*\ \

w.hbre Ao(x) is the L.,.

smallest length shift register prociuce that s e q u e n c e ,5 2 , . . . , ; . S1 S

\ ! r . | ' l l \ ^ ) l

LI

C o r n l u t eo u t n u i i i l . , . o
. \ \ i

\'
S

r - .) .l -

' I

5 Lra3

l)

.\

'-\

l- \

lr:r:il \
.

'.rr il.. \

,. 1

i ' i L r c i r r . i L ,l : L ) i i r ' : a , . . .. ' ! a 1 1

: r , illri:(rfL:riri1 r

\ 1 , , , .15: n . i . '

:L:.: . .a

. ' . ( \ r \

i , . i , ,
\

I , . t-. ..:rlei rclnom,ll

\l.lsn to choose treld thcsc so ilr3t eleneni .l -.r , r. .:, l n L r - r . i J n tJ t . c r .

n

.J',.,.'.

A,i'rs,,.=|

'rs,, . i .t,', - ^.I

j=0

J- )

is equalto zcro. No'.v.\.' : A, 1 -A:\; if 1 is chosen re rr,n r io = So, Choosem so that A- + 0 and A = -.\ \.A , ' : L \ .- A , A m ' r ^ m : 0

'iir'ilusr Ftnail.,- c.rric: trl bc -;ilci t:tl: L- is:iti si.rltaf. i-ltss-,f,il r t i i i J . a : t a , r al:: i h e n o s t ; e c : : : i t e l a : l o : tl i , r , . ' . : : : . : I . . I _
_r)

Deiemrne Lx riom ,\'''(x). lil-:lr r t a i nr n i i o m a b o r e .

"

rri l- : .ritJ.: i . : i: I . L.r'-n go io l. { liei3iro:rscontinueuntil r 2t) '11.,..: l.::l::l :l-:L,l;hm itrrittes L. rn,-lthe co;rec.:-.: ;-ol|nrtililJ ii:111sas iiliou ::
( -oi:rlrL:i

i:-.i:iu, i.r:: ( irritiru:.'

.\

. S,, : Sc,
ira)ril
' L S.

. ) ' r l i l , ) l. r i b L r l\h = t l a n d l l . , r :r l

:ll

iiavinl lr:r,::Lr i:c error locatirtns (A(r)) t,.:.;lsrt;r :s tLr(iijiinnrrr r-ia rilri nrag:lii;.lts (lor nonbinan BCll codcs). Again ml.-rr ilr.'rsion is circurlventedusins Froier's liconthnt.

!0I!EJ:rAlc!I]I!!]!11 = - \ , x " + A , , x ' - r+ . . - , \ , x + A , 1 S t 3 f i\ ! i i h , \ ( \ )

f T , i . . a - ,

D:lir:

l l r r ' \ \ l r i s, lri.oi:rl ;.oi_r ::Lrnrial

: , . . ,\
,l \
,

l:

s f r . r , ,' , ,
li
ti .1,l

:,,rd rr--. r - :rt: , i.

i u l \ n n n . f , la r \r', , ,nodrr ) .tc._, l: , :

L

, ,

', " ,/ _

+ ( ./
2{;.

'/,

) i ..,

, , , ' / '

f!r

:r

'Xlrr '

'

T T I l _

:.'.;,l

ELrd l\- )

Lr-1i=1

I
_t_ l :

) 1Y , X ,i t

' tf tr, ,ti i

l=l

I T l tli ::=i

.\,

\.-\ l1 \ - .

ii T l r I
i := . ! .- :

r..l rt(ta t )

\_' \ r fl T r l - \ . r ) I
t.-

alairi rilll{ilLLJCa::: -,

r:. iil a',

1 r 1,

l,L\

: l-iir r,.\ l
i ' r r r r i Fror i-1
r _ \ 1 I tt ir l l
i=i i='

\'i\

I*

\rt\

-\r /

- x,\, ,l .-'

)'oil

i X,fI(1 r , \ , )
-\'(X,') : Finall): ir r:c:e thar t er;oisoccurs algoriilu l:i]s. r: . an ulcorreci:ble eror
Di1[elll Occ',I{ed.

x,fI(r
)=!

xj'xrJ

,:-p

h \ I e s t u r s r r r o r . . o c pro l r r o n : : - . . . . . . t i i l . : t i r a t : . r o - bv tesdngii eror svmbols in rh: -i,;nboliieio. are