Scribd
Upload
16 views1 page

Practice Questions for Module III

Uploaded by

palanudipan
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
16 views1 page

Practice Questions for Module III

Uploaded by

palanudipan
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/ 1

Practice Questions on Module III

1. State the advantages of cyclic codes


2. For a systematic (7, 3) cyclic code determine the generator matrix and parity
check matrix if g(x) = x4+x 3+x2+1.
3. Determine systematic & nonsystematic code words for i = (1101) for the (7,4)
code with g(x) = x3+x+1
4. Given that x7 + 1= (x+1) (x3+x2+1) (x3+x+1), determine the generator
polynomials of all the cyclic codes with block length 7.
5. Code word polynomial c(x) belonging to the (7, 4) cyclic code with g(x) =
1+x+x3 incurs errors so as to produce received polynomial v(x). Find c(x) when
(a) v(x) = x5+x2+1
(b) v(x) = x6+x3+1
6. A message 101101 is to be transmitted in cyclic code with a generator
polynomial G(p)= p4+p3+1. Obtain the transmitted code word in both
systematic and non-systematic form. How many check bits (i.e., parity bits)
does the encoded message contain? What is the order of the cyclic code?
7. Determine the Galois Field elements of GF (24) for the corresponding
polynomial p(x) = x4+x+1
8. What do you mean by primitive element? α3, α 10 are field elements of GF(24),
determine their order and check whether or not they are primitive elements.
9. Find the minimal polynomial of α4 in GF (24)
10. What is irreducible polynomial and primitive polynomial?
11. Check whether x3+x+1 is an irreducible polynomial.
12. α6, α3 are field elements of GF (23), determine their order and check whether
or not they are primitive elements.
13. Find the conjugates of α6, α4 in GF (24).
14. Determine the Galois Field elements of GF (23) for the corresponding
polynomial f(x) = x3+x+1
15. Find the conjugates of α5 in GF (23).
16. Determine the minimal polynomial of α5 in GF (23).
17. State the condition when a t – error correcting cyclic code is considered to be
a BCH code.
18. Construct a single error correcting BCH code with block length n=15 over GF
(24).

You might also like