You are on page 1of 1

Birla Institute of Technology & Science, Pilani

Second Semester 2023-24


Tutorial - 8

Q.1. Consider the (23, 12, 7) binary code. Show that it its used over a BSC with probability of bit error p =
0.01, the word error will be approximately 0.00008.
Q.2. Let C be a binary code of length n with minimum distance 7. Show that the code is perfect for n = 7
and n=23.
Q.3. For a (5, 3) code over GF(4), the generator matrix is given by

1 0 0 1 1
0 1 0 1 2
0 0 1 1 3
i) Find the parity check matrix
ii) How many errors can this code detect?
iii) How many error can this code correct?
iv) How many erasure can this code correct?
v) Is this a perfect code?

You might also like