Class Time: Monday 5:00p - 7:40p, Humanities 129.
Instructor: Dr. Corbett Redden. Corbett.Redden [att] liu.edu. Office: Winnick House 233. Phone 516-299-3487.
Office Hours: Tuesday and Thursday 12:30p - 1:50p, or by appointment. I will also usually be available in my office before class, and you are welcome to drop by then.
Course webpage: http://myweb.liu.edu/~dredden/512s19/
Textbook: There is no official text for the course, but I will be using the following two sources:
Course notes "Error-correcting Codes" from Franz Lemmermeyer, available on his website at http://www.fen.bilkent.edu.tr/~franz/lect/codes.pdf, and
"Introduction to the theory of error-correcting codes" by Vera Pless (3rd ed, Wiley, 1998).
Grading Scheme:
| Attendance | 10% |
| Homework | 20% |
| Quizzes | 40% |
| Final Exam | 30% |
Homework: http://myweb.liu.edu/~dredden/512s19/Homework.pdf Homework will be assigned weekly. It will be discussed and and checked during the following week's class. Please upload photo(s) of your homework at https://dbinbox.com/Math615.
Quizzes: There will be approximately four in-class quizzes throughout the semester. These will be announced ahead of time and will be used to assess your knowledge of the material.
Final Exam: The final examination will be CUMULATIVE, and will occur during the usual class time on Monday 5/6. The final will comprise 30% of your course grade, though the instructor reserves the right to count the final as an even higher percentage for those students whose final exam grade is better than their test average. Depending on student performance and interest, the professor may choose to replace the Final Exam with a Final Project.
Course description for this semester: This course will cover basic information theory and the theory of error-detecting and error-correcting codes, with a primary emphasis on the theory of linear codes. There are no official prerequisites, but it will be helpful if you are comfortable with modular arithmetic, matrix algebra, and basic probability theory.
Official course description from the Graduate Bulletin: This course will cover mathematical logic and its applications to computing in the modern world. Topics covered include propositional and predicate calculus, Turing machines, computability, Godel's incompleteness theorem, coding, error-correcting codes, information and entropy. (3 credits)
Help: You are welcome to see Prof. Redden in office hours, by appointment, or to ask short questions via email. You are also encouraged to work with others on homework. Explaining concepts and techniques to fellow classmates is an excellent way for you to better understand them yourself.
Important Dates:
| Mon Jan 28 | First class |
| Mon Feb 4 | Last day to add/drop or late register |
| Mon Feb 18 | No classes. President's Day |
| Tues Feb 19 | Monday classes meet |
| Mar 11-15 | Spring recess, no classes |
| Fri Apr 5 | Last day to opt for P/F or withdraw |
| Mon Apr 29 | Last class |
| Mon May 6 | Final Exam |