Professional Documents
Culture Documents
Discrete Maths NOVEMBER 2011
Discrete Maths NOVEMBER 2011
p x1 x2 ' x6 x3 x4 x5 ' x7 x3 x6 x8 ' .
(or)
(b) Define the following terms:
(i) Identity-gate (ii) Not-gate (iii) And gate (iv) Or-gate.
3. (a) Let F be a finite field of characteristic p. Then prove that F contains p n elements,
where n F : Z p .
(or)
(b) Let F be a field and p a prime prove that the following are equivalent :
(i) m/n (ii) p m 1/ p n 1 (iii) xm 1/ xn 1.
only if k divides n.
(or)
(b) State and prove Chinese Remainder theorem for polynomials.
5. (a) Let G be a generator matrix of a linear code C. Then prove that the rows of G form a
basis of C.
(or)
(b) Let h be a check polynomial of a cyclic code with generator polynomial g and v Vn ,
polynomials.
(b) If f has prime degree, then prove that f is indecomposable.
10. State and prove Gilbert-Varshamov Bound.