b)

a)
b)
0)

೩)

0)

0)

a)
b)
0)

೩)
0)
௦)
6)

000001T203121903

multiplexed using TDM. If each channel sends 100 bytes/sec and we multiplex
1 byte per channel determine the frame rate and bit rate of the link.
Generate the dictionary for the string 0011 0110 0011 0101 0100 1001 0011
0100 0001 0100 1011 0010 110 using Lempel-Ziv (Zip coding) algorithm.
Write short notes on WDM and DWDM.
Illustrate the construction of Huffman tree with an example.
Explain two dimensional parity check code. Illustrate the type of error
undetected by the two-dimensional parity check code.
PART C

Answer any two full questions, each carries 20 marks.

Find the Hamming distance for the following code words and determine the

minimum Hamming distance.
1. 0)1111.1111(
1. 0(10101,10010)
11. 661000,0000)
Explain the encoding and decoding process of CRC (Cyclic Redundancy
Check) with example.
Compare and contrast about the efficiency and delay of circuit switching and
packet switching.
Differentiate between single bit error and burst error with examples.
With a neat sketch explain the architecture of GPRS.

Consider the following generator matrix over GF(3)

1 0 1 2 0
1 2 0 0 1
0 1 2 1 0

Generate all possible codewords using this matrix.

Find the parity check matrix H. What is the minimum distance of this code?
How many errors can this code detect and correct?

Write short notes on WiMax.

Write short notes on RS codes.

Identify the difficulties associated with wireless communication.

Explain the salient features of GSM.

॥ मैप मर ‏بد‎

Page 2 of 2

(8)

(5)
(5)
(5)

(4)

(8)

(8)

(3)
(7)
(10)

(5)
(5)
(3)
(7)