problem2 - University of California San Diego ECE 259A:...

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

View Full Document Right Arrow Icon
University of California San Diego ECE 259A: Problem Set #2 1 . Recall that the syndrome s is a linear function of the error-pattern e . A linear decoder finds its estimate e of the error-pattern as a linear function of s . That is e L s , where L satisfies L s s L s L s . Show that a linear decoder for a binary linear code can correct at most n k of the n single erorrs (and, hence, it is not a particularly useful decoder). 2 . Another proof of the Gilbert-Varshamov bound (due to Gilbert): (a) Given an n , 2 k , d binary code – not necessarily linear – show that for any integer r , the average number of codewords in a Hamming sphere of radius r is given by r def x n 2 x , r 2 n V n , r 2 n k where V n , r r i 0 n i is the volume of the Hamming sphere of radius r . (b) Use the above relation with r d to show that there exist binary codes of rate R and mini- mum distance d , which satisfy R 1 1 n log 2 V n , d . 3
Background image of page 1

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

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

Page1 / 2

problem2 - University of California San Diego ECE 259A:...

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