NOVEMBER 2013 HMA34

Time:Three hours Maximum:75 marks

SECTION A -(5×6=30 MARKS)

Answer ALL questions.
1. (a) Let L be a lattice. Show that without the use of duality that the following conditions
are equivalent:

(i) a, b, c  L;  a  b   c   a  c   b  c 

(ii) a, b, c  L;  a  b   c   a  c   b  c 

(or)

(b) Let B be a finite Boolean algebra, and let A denote the set of all atoms in B. Prove that B
is isomorphic to P(A).

2. (a) Simplify: p    x1  x2  x1  x3     x1, x2 , x3 

(or)

(b) Find the Boolean polynomial for the bridge circuit:

x1 x4

x3

x2 x6

and draw an equivalent series parallel circuit.

3. (a) Let p be a prime and let m, n be natural numbers. Prove that

(i) If Fpm is a subfield of Fpn then m/n.

(ii) If m/n then Fpm  Fpn . There is exactly one subfield of Fpn with p m elements.

(or)

(b) Factorise x15  1 over F2 .

4. (a) Show that x q  x   fi , where the product is extended over all distinct, monic,
n

irreducible polynomials over Fq , with degree a divisor of n.

(b) Write Berlekamp’s algorithm.

d 2 n  1
 
5. (a) Prove that if q nk      q  i  then we can construct a Linear (n,k) code over
i

i 0  i 

Fq with minimum distance ≥ d.

(b) Show that the binary cyclic code of length n  2m  1 for which the generator
polynomial is the minimal polynomial over F2 of a primitive element of F2m is equivalent
to the binary(n, n-m) Hamming code.

SECTION B-(3×15=45 marks)

Answer any THREE questions.
6. Prove that a lattice is distributive if and only if

 x  y  x  z  y  z   x  y  x  z   y  z
7. Simplify f  x '1 x'2  x1x3 x4  x1x2 x '4  x '2 x3

8. For   Fqm  F and K  Fq , the trace TrF / K   of  over K is defined by

TrF / K       q  ........   q
m1

Prove: (a) TrF / K      TrF / K    TrF / K    for all  ,   F

(b) TrF / K  c   cTrF / K   for all   F , c  F
(c) TrF / K is a linear transformation from F onto K, where both F and K are vector
spaces over F.
(d) TrF / K  a   ma for all   F
(e) TrF / K  a 2   TrF / K   for all   F
9. Determine the Cyclotomic cosets mod 21 over F2 and find the Factorisation of x 21  1
over F2 .

10. Let Ci be the dual code of a code ci i=1,2. prove: (a) C 
i
 
 Ci

 C1  C2 

(b)  C 1  C  2

(c) If C1 is the (n,1,n) binary repetition code, then C 1 is the (n,n-1,2) parity-check code.