Scribd
Upload
27 views1 page

ITC Assignment 3

This document is an assignment for the course 'Introduction to Information Theory and Coding' at Maharaja Agrasen Institute of Technology. It includes a series of questions related to coding theory concepts such as Hamming distance, parity check matrices, LDPC codes, MDS codes, cyclic codes, Golay codes, and BCH codes. The assignment aims to assess students' understanding and application of these topics through various Bloom's Taxonomy levels.

Uploaded by

jhakarthik1909
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
27 views1 page

ITC Assignment 3

This document is an assignment for the course 'Introduction to Information Theory and Coding' at Maharaja Agrasen Institute of Technology. It includes a series of questions related to coding theory concepts such as Hamming distance, parity check matrices, LDPC codes, MDS codes, cyclic codes, Golay codes, and BCH codes. The assignment aims to assess students' understanding and application of these topics through various Bloom's Taxonomy levels.

Uploaded by

jhakarthik1909
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

MAHARAJA AGRASEN INSTITUTE OF TECHNOLOGY

Subject Name: INTRODUCTION TO INFORMATION THEORY AND CODING


Subject Code: ECC-332 Semester: 6th
Assignment No. 2
Bloom’s Taxonomy Levels: 1. Remember 2. Understand 3. Apply 4. Analyze 5. Evaluate 6. Create

Q. Question BTL CO
No. level
1. (a). Define Hamming distance and Hamming weight. 2 3
(b). Find the Hamming weight of the following code vector.
X = 11010100
(c). For a Hamming distance of 5, how many errors can be detected? How many
errors can be corrected?

2. The parity check matrix of a particular (7,4) linear block code is given by 5 3

1 1 1 0 1 0 0
[𝐻] = [1 1 0 1 0 1 0]
1 0 1 1 0 0 1

(a). Find the generator matrix (G)


(b). List all the code vectors.
(c). What is the minimum distance between the code vectors?
(d). How many errors can be detected? How many errors can be corrected?

3. The parity check matrix of a (7,4) Hamming code is as under: 5 3

1 1 0 1 1 0 0
[𝐻] = [1 1 1 0 0 1 1]
1 0 1 1 0 0 1

Calculate the syndrome vector for single bit errors.

4. Write short note on LDPC codes. 2 3

5. What do you understand by MDS codes? Explain with a suitable example. 2 3


6. For a (7,4) Cyclic code, determine the generator matrix if G(p) = 1+p+p3. 5 3
7. Draw the encoder for a (7,4) Cyclic Hamming code generated by the generator 6 3
polynomial, G(p) = 1+p+p3.
8. Write short note on Golay codes. 2 3
9. Explain the decoding procedure of BCH codes. How syndrome computation can be 4 3
utilized for the decoding of BCH codes.

10. What do you understand by Repetition codes. 2 3

You might also like