BCH code of 6) ternary Golary BCH code of the primitive ‘this code? same designed ‘the RS code? oo Sinary cuciic Codes 4.4 INTRODUCTION Binary cyclic codes are an important subclass of Linear Block Codes. These codes can be easily implemented using feedback shift registers; The syndrome calculation is easily accomplished with similar feedback shift registers; and the underlying algebraic structure of a cyclic code lends itself to efficient decoding methods. So, the advantages of Binary cyclic codes over Linear Block Codes are : 1, Encoding and syndrome calculations can be easily implemented using simple shifts registers with Feedback connection. 2, BCC codes have a fair amount of mathematical structure that makes it possible to design codes with useful error correcting properties. ‘An (114) linear code is called a Cyclic Code if it can be described by the following property; (2) Linear (®) Cyclic I the m tuple V = (2% 2), 0) muau My) 8 @ codeword in the subspace S, than VO) = (Ope By Bye Pomme Ua) obtained by an end-around shift is also a codeword in S. ‘The components of a codeword V= (0p, 0 =u Jy.) can be written as, in the form of polynomial VO) = 09 + OX + QE + an Vy y XH ‘The polynomial function V(X) can be thought of as a “Placeholder” for the digits of codeword V; that is, an n-tuple vector is described by a polynomial of degree 1-1 or less. The presence or absence of each term in the polynomial indicates the presence of a the corresponding location of the m-type.Information Theory & Coding 4.2 BINARY CYCLIC CODES 4.24 Algebraic Structure of Cyclic Codes If V(X) is an (1) degree codeword polynomial, than V(X), the remainder resulting from dividing X'V(X) by X"*1, is also a codeword; that is XIVQX) = g(X) (X"+ 1) + Remainder VOX) this remainder can de described in terms of modulo arithmetic as VAG) = XIV (0) modulo (X"+ 1) For the case i = 1, equation (2) becomes V(X) 0 + 1,X + VX? + set Oy.g OZ Dyey XL XVX) = WX + oX+ $09.9 XPT + Oya XP Now add and subtract ¥,,1 ; since 2.4 * 0.1 =0 okt 4 yk" 3% XV(X) vy + 1pX + 4X7 + XV) = 0X +2, (X" 41) ‘Since V(X) is of degree n-1, it cannot be divided by X"+1. Thus from equation 2, By Extension : VOU) =X'V(X)modulo (X" +1) 4.2.2 Binary Cyclic Code Properties ‘THEOREM : If g(X) is a polynomial of degree (n-k) and is a factor of X"1, then g(X) generates (n.k) cyclic code in which the Code Polynomial V(X) for a mess vector m = (MyM Mp. generated by V(X) = m(X) g(X) Proof : By using a generator polynomial, cyclic code can be generate, in such the way th block code using a generator matrix. The generator polynomial g(x) for an (n.k) cyclic cod is unique and in the form of 8(8) = go + 81X + g0X? PBF and codeword polynomial is given by V(X) = m(X) 00) V0) is a polynomial of degree n-1 or less. Therefore, the message polynomial written as,‘m(X) = tg + XK > myXB + ‘There are 2 codeword polynomials in an (nk) code. Hence g(x) must be of degree n-k, and every codeword polynomial in the (1, l) cyclic code can be expressed as VOD = (mg + MX Fenty XI) 30) Vis said to be a valid codeword of the subspace s if, and only if g(x) divides into V(X) without a remainder. 4.23. Encoding (Systematic Form) By using some algebraic properties of the cyclic code, it is possible to establish a systematic encoding procedure. The message vector in polynomial form is given by = mi) mag pee ae lg ) In systematic form, the message digits are utilized as part of the codeword. The message polynomial can be manipulate algebraically by shifting the message digits into the rightmost k stages of a codeword register, and then adding the parity digits by placing them in the leymost n-k stages. Multiply m(X) by X"-X, the right shifted message polynomial is ; OK gu() = ag XK my XAT mx" --@) Divide equation (2) by g(X) XPm(X) = g(X) 9(X) + CO. wae) where remainder 7(X) can be expressed as 10) = 19+ 4X4 yX2+ + rep or 10%) =X" m(2X) modulo g(X) By using equation (3) 78) + XK m(X) = 9(X) + 80%) = YOO, oA) The left hand side of equation (4) is a valid codeword of degree n-1 or less, and when its polynomial is divided by g(X) there is a zero remainder. This codeword can be expanded {nto its polynomial as follows ; 1X) + XE m(X) = 19 + HX + 1X? Type RED mgXOE + m XH my OT ‘The codeword polynomial corresponds to code vector = Dnt MOM weeny ~ GeeRparilycheckbits’” — K message bts Example 4.1: The Generator polynomial of « (7, 4) cyclic code is g(X) = 1+X+X3. Find codewords for message vector 1011 in the following ways : (a) By forming the code polynomial using v (8)