|
CSC310F Fall 2006 - Info*** LECTURES MW10 (location BA024), TUTORIAL F10 (location BA024) ***
Instructor: Sam Roweis; email csc310 at cs dot toronto dot edu
Please do NOT send Roweis or the tutor email about the class
directly to their personal accounts.
Lecture Times: Mondays, Wednesdays 10:10am -- 11:00 am
Tutorial Times: Fridays, 10:10am-11:00am
Office Hours: Wednesdays 9am-10am (before class)
Prerequisite:
CSC148H1/CSC150H1/CSC260H1; STA247H1/STA255H1/STA257H1/STA107H1;
MAT135Y1/MAT137Y1, MAT223H1/MAT240H1
Textbook
Marking Scheme Course Description Measuring information. The source coding theorem. Data compression using ad hoc methods and dictionary-based methods. Probabilistic source models, and their use via Huffman and arithmetic coding. Noisy channels and the channel coding theorem. Error correcting codes, and their decoding by algebraic and probabilistic methods.
[ Home | Course Information | Lecture Schedule/Notes | Textbook/Readings | Assignments/Tests | Computing | ] CSC310F - Information Theory || www.cs.toronto.edu/~roweis/csc310/ |