problem6

problem6 - UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical...

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 259B - Winter Quarter 2011 Probabilistic Coding Problem Set #6 Due Thursday, March 3, 2011 1. Consider the Tanner graph of the (7,4) Hamming code deFned in class. (a) ±ind all stopping sets of weight 3 or less. (b) Augment the Tanner graph with one additional parity-check for the code such that the resulting graph has no weight-3 stopping sets other than the supports of weight-3 codewords. 2. (a) Describe a parity-check matrix for the rate- 1 5 repetition code that is low-density, in the sense that the number of 1s is less than half the number of entries in the matrix. What are the variable and check degree distributions from the node and edge perspectives? (b) Show that the corresponding Tanner graph has no cycles of length 4. (c) A systematic repeat-accumulate (RA) code is obtained by transmitting the input word along with the RA codeword. Consider a systematic RA encoder in which the input blocklength is 2, the repetition code is rate-
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

problem6 - UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical...

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