Main lecture points:
Things you should be able to do and answer after reviewing the lecture:
We have now covered most of the material in the ‘week 1’ slides (I didn’t quite finish, but will next time). Ask on NB if anything is unclear, or too compressed.
Make sure you have done the maths background reading from the last lecture.
Being able to quickly compute and plot things is a useful research skill. Last time I suggested reproducing a plot of repetition code properties. This time you could try reproducing plots showing binomial distributions and the performance of block codes. It’s possible you’d hit numerical or other problems, which I’d be happy to help with.
This page maintained by Iain Murray.
Last updated: 2014/09/19 14:19:23
Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: school-office@inf.ed.ac.uk Please contact our webadmin with any comments or corrections. Logging and Cookies Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh |