Scribd
Upload
25 views1 page

Assignment 1

1) The document provides details for Assignment 1 of the course EE 605: Error Correcting Codes including 4 proof and calculation exercises related to Hamming distance, binary symmetric channels, repetition codes, and adding a parity bit. 2) Students are asked to prove properties of Hamming distance, calculate crossover probabilities for binary symmetric channels, derive optimal decoding rules for repetition codes, and show how adding a parity bit increases minimum distance. 3) The assignment is due on August 4, 2010 and each exercise is worth 5 points for a total of 20 points.

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
25 views1 page

Assignment 1

1) The document provides details for Assignment 1 of the course EE 605: Error Correcting Codes including 4 proof and calculation exercises related to Hamming distance, binary symmetric channels, repetition codes, and adding a parity bit. 2) Students are asked to prove properties of Hamming distance, calculate crossover probabilities for binary symmetric channels, derive optimal decoding rules for repetition codes, and show how adding a parity bit increases minimum distance. 3) The assignment is due on August 4, 2010 and each exercise is worth 5 points for a total of 20 points.

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

Assignment 1 : 20 points

Due date: August 4, 2010

Each of the following exercises is worth 5 points. Every nontrivial step in a proof should be accompanied by justication. 1. Prove that the Hamming distance satises the triangle inequality, i.e. d(u, v) d(u, w) + d(w, v) for all n-tuples u, v, w. 2. Calculate the crossover probability of the binary symmetric channel which is equivalent to the system below. BSC(p)

Binary Input

BSC(p)

BSC(p)

Majority function

BSC(p)

Binary Output

BSC(p)

3. Derive the optimal decoding rule for a 2n-repetition code for use over a binary symmetric channel with crossover probability p. Is the optimal decoding rule unique? Calculate the average probability of error for this code when the optimal decoding rule is used. 4. Consider a binary block code C of length n having minimum distance dmin where dmin is an odd integer. Show that when a overall parity bit is added to all the codewords in C we obtain a code of length n + 1 and minimum distance dmin + 1.

You might also like