Scribd
Upload
16 views2 pages

Assignment ITC

This document contains an assignment on information theory and coding for an electronics and communication engineering course. It includes 9 questions involving constructing Galois fields, determining generator and parity check matrices, finding minimum distances and syndromes, performing syndrome decoding, and proving properties of error patterns and codewords. Students are asked to work with various linear block codes and solve problems related to their representations, encodings, and decodings.

Uploaded by

Ayush Kumar
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 views2 pages

Assignment ITC

This document contains an assignment on information theory and coding for an electronics and communication engineering course. It includes 9 questions involving constructing Galois fields, determining generator and parity check matrices, finding minimum distances and syndromes, performing syndrome decoding, and proving properties of error patterns and codewords. Students are asked to work with various linear block codes and solve problems related to their representations, encodings, and decodings.

Uploaded by

Ayush Kumar
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

National Institute of Technology Andhra Pradesh

Department of Electronics and Communication Engineering


EC354: Information Theory and Coding
Assignment 3

1. Construct Addition and Multiplication tables for GF(5) and GF(7).


2. The generator matrix for a linear code is
 
0 0 1 1 1 0 1
G = 0 1 0 0 1 1 1
1 0 0 1 1 1 0
(a) Express G in systematic form.
(b) Determine the parity check matrix H for the code.
(c) Construct the table of syndromes for the code.
(d) Determine the minimum distance of the code.
(e) Demonstrate that the codeword C corresponding to the information sequence 101
satisfies CH T = 0
3. Let C be a binary (6, 3) code with the parity check matrix,
 
1 1 0 1 0 0
H= 0 1
 1 1 1 0
1 0 0 1 1 1
[4]
(a) Find coset leaders and their syndromes.
(b) Use syndrome decoding to decode the following received vectors: (i) 110000; (ii) 000011.
4. Let C be a binary (5, 3) code with generator matrix,
 
1 0 1 1 0
G = 1 1 0 1 0
0 1 0 0 1
(a) Reduce G to standard form.
(b) Find a parity-check matrix for C.
(c) Write out the elements of the dual code C ⊥ .
5. A systematic (6,3) code has the generator matrix
 
1 0 0 1 1 0
G = 0 1 0 0 1 1
0 0 1 1 0 1
Construct the standard array and determine the error patterns and their corresponding
syndromes.
6. Let C be the binary linear code with generator matrix
 
1 0 0 1 0 1
G= 0 1 0 1 1
 0
0 0 1 0 1 1

(a) Write down a parity check matrix H for C. Explain how the minimum distance of C
may be deduced from H. Find d(C).
(b) How many cosets does C have? How many cosets are led by weight 1 vectors ? Does
any coset have a weight 2 coset leader?
(c) Construct a syndrome look-up table for C. Hence, or otherwise, decode the received
vectors 100110, 011101 and 101001.

7. For a (6,3) systematic linear block code, the three parity-check bits c4 , c5 , and c6 are formed
from the following equations:

c 4 = b1 ⊕ b3
c 5 = b1 ⊕ b2 ⊕ b3
c 6 = b1 ⊕ b2

(a) Write the generator matrix G.


(b) Construct all possible codewords.
(c) Suppose the received word is 010111. Decode this received word by finding the location
of the error and what the transmitted message was.

8. Prove that if sum of two error patterns e1 and e2 is a valid codeword cj , then each error
pattern has the same syndrome.

9. Prove that any n-tuples in the same row of a standard array add to produce a valid codeword.

Page 2

You might also like