Computer Laboratory

Andrew Lewis – Supervisions

Information Theory and Coding

Work for each supervision is given below.

Please email your solutions (PDF or text) 24 hours before the supervision, or put written work in the box at the CL student reception before midday the day before the supervision.

If you can't do a question after some thought, try to work out exactly where the problem lies and write down your working so far. We will discuss this in the supervision. Leave a question if you definitely haven't covered the material yet in lectures and can't work it out from the notes (apologies if this is the case).

Supervision 1

Supervision 2
  • Read through notes from the section on continuous information to the channel capacity equation.
  • Do exercises 3B, 4, 5B and 8 (a), (b) in the learning guide.
  • Exam question: CST 2001-07-12 part (c)
    SNR
  • Exam question: CST 2002-09-10 part (b)
    FT properties
  • Exam question: CST 2006-08-16 parts (d) and (e)
    Aliasing, convolution
  • Exam question: CST 2006-07-08 part (e)
    Sampling, self-Fourier functions
  • Exam question: CST 2005-08-10 parts (b) and (c)
    Modulation, FT properties, coding revision
  • Exam question: CST 2008-09-10 part (a)
    DFT
  • Exam question: CST 2008-08-09 parts (b) and (c)
    Noise removal, modulation

Supervision 3
  • Exam question: CST 2007-08-07 parts (b)–(e)
    Nyquist, Gabor wavelets, DFT
  • Exam question: CST 2007-07-08 parts (c) and (d)
    Invertible transforms, the information diagram
  • Exam question: CST 2001-09-10
    Binary codes and entropy, minimal description length, Nyquist, noise removal
  • Exam question: CST 2002-07-12
    Encoding bandlimited signals, binary code length, DFT
  • Exam question: CST 2002-09-10 part (c)
    Logan's theorem
  • Exam question: CST 2001-07-12 part (b)
    Kolmogorov complexity