hw-6-2009 - according to their weights. 3) Decode the...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 556: Coding Theory, 2009 HW 6 Issued: November 8th, 2009 Due: November 17th, 2009 November 8, 2009 A range Problems 1) Find the best binary linear code you can that has length 1000 and can correct 100 errors. 2) You saw in the exam that a binary cyclic code with the ”reciprocal equa- tion” acts as a double-error correcting code if m is odd. Take m = 5 and develop a decoding algorithm for the code. Classify all the coset leaders
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: according to their weights. 3) Decode the following codewords of the Golay code, using the hexacode approach: 1) 011010 010101 100010 110010 2) 000000 101101 111000 1 010010 If the received word is distance four from the code, nd the coset leader that has a one in the top-left position. 2...
View Full Document

Page1 / 2

hw-6-2009 - according to their weights. 3) Decode the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online