Scribd
Upload
2 views2 pages

Problem Set 01

The document contains Problem Set 1 for the course EE5605, focusing on error-correcting codes for communications and distributed systems. It includes questions on proving properties of codes related to error correction and detection, constructing specific codes, analyzing an asymmetric channel, and discussing the properties of a given alphabet. The problems require theoretical proofs and practical applications related to coding theory.

Uploaded by

Surajit Sahoo
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
2 views2 pages

Problem Set 01

The document contains Problem Set 1 for the course EE5605, focusing on error-correcting codes for communications and distributed systems. It includes questions on proving properties of codes related to error correction and detection, constructing specific codes, analyzing an asymmetric channel, and discussing the properties of a given alphabet. The problems require theoretical proofs and practical applications related to coding theory.

Uploaded by

Surajit Sahoo
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

EE5605 - Error-Correcting Codes for Communications

and Distributed Systems

Problem Set 1

Questions
1. Let C denote an (n, M, dmin ) code. Prove the following:
(a) If C can correct t errors, then dmin ≥ 2t + 1.
(b) If C can detect t errors, then dmin ≥ t + 1.
(c) If C can correct t erasures, then dmin ≥ t + 1.
2. Show that there does not exist an (n = 4, M = 3, dmin = 3) code
over F = {0, 1}. Hint: You may argue as follows. Consider the two
(1) (1) (1) (1) (2) (2) (2) (2)
codewords c(1) = (c1 c2 c3 c4 ), c(2) = (c1 c2 c3 c4 ). Assume
(1) (2) (1) (2) (1) (2)
without loss of generality that c1 ̸= c1 , c2 ̸= c2 and c3 ̸= c3 .
Now you may argue that it is not possible to have a third codeword.
3. Construct an (n = 6, M = 4) code over F = {0, 1} with minimum
distance dmin ≥ 3.
4. Consider the “asymmetric” channel shown in Fig. 1. Here if 1 is trans-
mitted, it is received without any error. However, if a 0 is transmitted,
it may get flipped with probability p < 0.5. Let C = {000, 010, 101, 110}
denote the code used. All codewords are equally likely to be transmit-
ted. Obtain the optimal decoder in the form of a “decoding table” as
given below. Compute the probability of error if (000) is transmitted.
Does the probability of error depend on the transmitted codeword?
Justify your answer.

Received Word Decoder Output


(000) –
(001) –
.. ..
. .
(111) –

1
1−𝑝
0 0
𝑝

1 1
1

Figure 1: An asymmetric channel model.

5. Let F = {x, y, z} denote an alphabet with (partially filled) addition


table as follows.

+ x y z
x
y z
z z

Argue that F cannot be a field.

You might also like