Information Theory (Fall 2017)

Second midterm with sketches of solutions

Third midterm with sketches of solutions (You can find the third midterm together with figures here .)

For those who are missing one and only one successful midterm there will be a final retake opportunity on Wednesday December 6 at 18:15 in the room I. 2.17.1. (It is one floor above the usual room of class meetings.) Participants here can retake the unique midterm they failed to write successfully.

Class meetings: Wedneday 9:15 -12:00

Midterms: There will be three midterms during the semester according to the following schedule. The duration of each is 60 minutes.

October 3, 18:15 (6:15 p.m.) room: IB027

October 31, 18:15 (6:15 p.m.) room: IB027

November 23, 18:15 (6:15 p.m.) room: IB027

Grading:

For getting a valid grade at least 40% of the score should be achieved on each midterm. The final grade is calculated by averaging the results of the three midterms each taken with weight 1/3. Conversion to grades is as follows: from 85% to 100% performance the grade is 5. Below that it is 4 from 70%, 3 from 55%, and 2 from 40%. Below 40% no valid grade is obtained.

Make up tests:

October 10, 18:15 (6:15 p.m.) room: IE220

November 7, 18:15 (6:15 p.m.) room: IE220

November 28, 18:15 (6:15 p.m.) room: IE220

Rules of how make up midterm scores are taken into account:

If someone takes a make up midterm for improving the result of the corresponding midterm, then the new result will be valid even if it is weaker than the original one. There is one exception to this: If on an original midterm one already achieved 40% of the score then the midterm remains valid even if the make up score is below 40%. However, even in that case, the result of the make up midterm is used for calculating the final grade and if the weighted average score of the three midterms is below 40%, then it does not qualify for a valid grade.

Lecture notes (Fall 2017)

Examples for the Lempel-Ziv data compression algorithms LZ77 and LZ78 (Source: Györfi László, Gyôri Sándor, Vajda István "Információ- és kódelmélet", textbook in Hungarian, published by Typotex Kiadó)

Example for the Lempel-Ziv-Welch data compression algorithm (Source: Györfi László, Gyôri Sándor, Vajda István "Információ- és kódelmélet", textbook in Hungarian, published by Typotex Kiadó)

Some exercises

Two more channel capacity calculation exercises (two others are in the lecture notes)