Sem-III Groups and Coding Theory
Sem-III Groups and Coding Theory
-6378 SEALNo
|lotal No, of Pages : 2
|6155-3,J
S.Y. B.Se.
(Cdmputer Science)
AIAEMATICS
MIC2E? Groups and Coding Theory
(2019 attet)(Semester I) (2322)
Timc: 2 Haurd
Ine Mux. Murks : 3S
wctiens to thndetes:
4M in are cempulsor
2) Feres tode rghr indicate full marks.
Nen-preummable xientific caleulalor is ullowed.
Q) Attenpt wny Five of the following: (5 2 = 10)
a) St.le Fucl:ds Lemma.
b Find IHaming distance betwecn xundy. wherei= 1101I0 and
y=01|10!
Check whether the permutation1,2,3, 4. 6) (8. 9) is cven
or odd!'
Justify.
d) Define term 'Group'.
Find all generators of
If (a, b) = land blac-thÇH show that b<e.
Let G =(:,) be a groua hd H={0.Z} bc a subgroup of GFind two
right cosets of H in GA
PT0.
Q3) Altempt any one of the following: || x 10 10)
Find gcd of 4999 and 1109 and also find integers m,n such that (4999,
1109) =(4999) +n(1109).
b) For the set ' of non-zero rationals, then the binary
ab
CAAP
operation
1 7 2 3 6 .3
6 91
93
defud as a*h=.
3 Show that (', )is an abelian
group
c) Determ theghjup code , : B' ’B whose given parity check matrix
IS.
17.236.69.9s/122023
13:19:59
CAAPOfi69:
1
H=
| 0
6 91
.95/
3 12.
1 23
0:2
139:59
CAAPO11691