homework2 - matrix: = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 H Problem...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 421 – Fall 2010 Homework 2 Problem 1 Consider the binary code composed by the 4 codewords: C={(000000),(100100),(010010), (001001)} What is its minimum distance? Is this code linear? Problem 2 Find the lower bound on required minimum distance for the following codes: A single-error correcting binary code A triple-error correcting binary code A six-error detecting binary code Problem 3 Find the length n, the dimension k, the minimum distance, the generating (encoding) matrix and a possible base for the linear code defined by the following parity check
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: matrix: = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 H Problem 4 Generate the G and H matrix for a Hamming code with r=n-k=4. Determine a code basis Evaluate the minimum distance Evaluate the error correction capability t and the error detection capability e Problem 5 Write a possible standard array and calculate the associated syndromes for the code with generating matrix = 1 1 1 1 1 G...
View Full Document

This note was uploaded on 04/24/2011 for the course EE 4421 taught by Professor Mondin during the Spring '11 term at California State University Los Angeles .

Ask a homework question - tutors are online