Scribd
Upload
28 views

EE 605: Error Correcting Codes

This document contains a 3 question quiz on error correcting codes. The quiz covers finding a generator matrix for the smallest code containing given codewords, properties of intersections and unions of codes, and properties of the Hamming weights of codewords in a binary linear block code. Students have 60 minutes to complete the quiz and justify all non-trivial steps in proofs.

Uploaded by

Rotem Horowitz
Copyright
© Attribution Non-Commercial (BY-NC)
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
28 views

EE 605: Error Correcting Codes

This document contains a 3 question quiz on error correcting codes. The quiz covers finding a generator matrix for the smallest code containing given codewords, properties of intersections and unions of codes, and properties of the Hamming weights of codewords in a binary linear block code. Students have 60 minutes to complete the quiz and justify all non-trivial steps in proofs.

Uploaded by

Rotem Horowitz
Copyright
© Attribution Non-Commercial (BY-NC)
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

EE 605: Error Correcting Codes

Instructor: Saravanan Vijayakumaran Indian Institute of Technology Bombay Autumn 2011

Quiz 1 : 15 points

Duration: 60 minutes

Each of the following questions is worth 5 points. Every nontrivial step in a proof should be accompanied by justication. 1. Find the smallest binary linear block code which contains the following codewords {100101, 110010, 010111, 001011}. Find a systematic generator matrix for this code. What is the minimum distance of this code? 2. Let C1 and C2 be two linear block codes of same length n. (a) Show that C1 C2 is a linear code. (b) Show that C1 C2 is a linear code if and only if either C1 C2 or C2 C1 . 3. Show that in every binary linear block code either all the codewords have even Hamming weight or exactly half of the codewords have even Hamming weight. Hint: n T i=1 vi = 0 for a codeword v of even weight or equivalently v 1 = 0 where 1 is the 1 n vector containing all ones.

You might also like