Scribd
Upload
29 views2 pages

Tutorial 3 - Unit IV

Uploaded by

Rupak Datta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Tutorial 3 - Unit IV

Uploaded by

Rupak Datta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SRM Institute of Science and Technology

College of Engineering and Technology


Department of Mathematics
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamil Nadu
Academic Year: 2023-2024(ODD)
Tutorial sheet - 3

Date: 16/10/2023
Course Code &Title:18MAB302T-Discrete Mathematics for Engineers
Year & Sem: III/V

Q. No Questions Answer Keys


1 Prove that 𝐵 𝑛 = (𝑥1, 𝑥2 , . . . , 𝑥𝑛 )/𝑥𝑖 𝜖 𝐵 forms an abelian group
with respect to addition modulo 2, where 𝐵 = 0,1 .

2 Define minimum distance of a code and calculate the minimum Minimum distance
distance between the codes between the codes = 1

𝑥 = 11010, 𝑦 = 10101, 𝑧 = 10011

3 Find the weight of the word 110101 4

4 Find the minimum distance between the code words 0000, 0110, 1011, 2
1100.

5 Find the code word generated by the encoding function 00000


𝑒 ∶ 𝐵 2 → 𝐵 5 with respect to the parity check matrix 01011
10011
0 1 1 11000
0 1 1
𝐻= 1 0 0
0 1 0
0 0 1
6 Find the code words generated by the parity check matrix 000000
1 1 01 0 0 𝑇 001011
010101
1 0 10 1 0 when the encoding function is 100111
1 1 10 0 1 011110
𝑒 ∶ 𝐵3 → 𝐵6 . 101100
110010
111001
7 Find the code words for 𝑤 ∈ 𝐵2 assume that e(00)= 𝟎 𝟎 𝟎 𝟎 𝟎
10110 e(01)= 𝟎 𝟏 𝟎 𝟏 𝟏
𝐺= e(10)= 𝟏 𝟎 𝟏 𝟏 𝟎
01011 e(11)= 𝟏 𝟏 𝟏 𝟎 𝟏

8 Find the Hamming distance between x =11010 and y = 10101 4

9 1 0 0 1 1 0
Given the generator matrix 0 1 0 0 1 1 corresponding to
0 0 1 1 0 1 Original message: 110, 001
3 6
the encoding function 𝑒 ∶ 𝐵 → 𝐵 , find the corresponding parity
check matrix and use it to decode the received words 110101,
001111 and hence to find the original message.

10 How many errors can be corrected in the encoded words 000 and 0 or 1
111?

You might also like