Sciences de l’information

Instructor Ruediger Urbanke
Office INR 116
Phone +4121 6937692
Email ruediger.urbanke@epfl.ch
Office Hours By appointment
Teaching Assistant Shrinivas Kudekar
   
Lectures Thursday 8:15 – 10:00
Exercises Thursday 10:15 – 12:00
Room CE 3

What we will cover

Imagine, you would like to preserve the music of your favorite band on a CD. What does it take to put music on a CD? You would use a microphone to transform the acoustic waves into an electrical signal. Now you are faced with your first challenge. The electrical signal is continuous in time but all you can store on a CD are bits (zeros and ones)! The first step therefore is to sample the signal, transforming the continuous waveform in a sequence of samples (numbers). Quite suprisingly, if done correctly, this step entails no loss of quality and you can reconstruct the original continuous waveform perfectly from the discrete set of samples. As a next step you will represent the samples (numbers) as sequence of bits (zeros and ones) and if possible compress this sequence of bits, i.e., represent the information contained therein in a more compact way. It is not unusual that you can achieve a compression by a factor ten or more without any essential loss in quality (just think of long pauses or repetitive patterns in the music). This second step is called source coding. You can now store the information on a CD. This is done by storing the sequence of bits are as a sequence of flat regions versus bumps on the surface of the CD, changing the reflectivity of the surface. Since the physical dimensions of each “bump” are tiny (less than a million-th of a meter), even small impurities (fingerprints, dust, …) on the surface of the CD can cause lots of bits to be “erased” if you try to read the data back. Therefore, it is important that before storing your data you add some redundancy to your data. This will ensure that you can retrieve it correctly even if some of the data is lost or corrupted. This is called error correction coding. As a final step you might want to protect your data from unauthorized access by encrypting it.

Exams and Grading

The final grade is determined as follows:

Graded Homeworks 10%
Final Exam 90%
—————————- ——-
Total 100%

Special Announcements

Graded Homeworks can be collected from INR 034 or INR 032 from Thursday 22nd Jan 15:00 onwards.

Final Exam: January 16, from 8 – 12 in CO1 and CO2; closed book, no calculator, no mobile phone, no friend, no cheat sheet, no formula book; only you and your brain

To find some further problems with solutions visit the web page from last year: http://moodle.epfl.ch/course/view.php?id=851

 

Instructions for Graded Homeworks

There are 4 graded homeworks, one for each module. Although you will receive some points that count towards your final grade, these homeworks are really designed for you to see if you can solve problems on your own. Use this chance.

For each graded homework it would therefore be best for you to solve it completely on your own.

But if you have trouble YOU CAN: (i) ask us in class if you do not know how to solve it, (ii) discuss with your colleagues; YOU CANNOT: (i) copy a solution from a friend (and neither from an enemy);

After any discussion you might have had, write down the solutions in your own words and independently from your colleagues.

IF WE FIND SIMILARITIES IN SOLUTIONS THAT GO BEYOND RANDOM, ALL INVOLVED SOLUTIONS WILL RECEIVE 0 POINTS, REGARDLESS OF WHO COPIED FROM WHOM.

Detailed Schedule

 

Date Topic Assignment Due Date/Solutions Posted Remarks  
Sep 18 Introduction – 1h slides/ Signal Processing – 1h slides Homework 1 Solutions    
Sep 25 Signal Processing – 2h slides Homework 2 Solutions    
Oct 2 Signal Processing – 2h slides Homework 3 Solutions    
Oct 9 Signal Processing – 1h/ Source Coding – 1h Graded Homework Solutions Due date is 16th October before 11:00 (during exercise session)  
Oct 16 Source Coding – 2h Homework 5 Solutions    
Oct 23 Source Coding – 2h Homework 6 Solutions    
Oct 30 Source Coding – 1h / Cryptography – 1h Graded Homework Solutions Due date is 12th November before 11:00 (during exercise session)  
Nov 6 Cryptography – 2h Homework 8 Solutions    
Nov 13 Cryptography – 2h Homework 9 Solutions    
Nov 20 Cryptography – 2h Homework 10 Solutions    
Nov 27 Cryptography – 1h / Channel Coding – 1h Graded Homework Solutions Due date is 4th December before 11:00 (during exercise session)  
Dec 4 Channel Coding – 2h Homework 12 Solutions    
Dec 11 Channel Coding – 2h Graded Homework 4 Solutions Due date is 22nd December before 12:00pm (lunch time in INR034 or INR 032)  
Dec 18 Channel Coding – 2h        

Course Notes

Additional Reading Material

 

The following is a set of links that contain some useful information. Some contain applets, some contain recommendations for further reading.