Class Time: Monday 5:00p - 7:40p, Humanities 130.
Instructor: Dr. Corbett Redden. Corbett.Redden [att] liu.edu. Office: Life Sciences 237. Phone 516-299-3487.
Office Hours: Monday 2:00p - 4:30p (or by appointment)
Course webpage: http://myweb.liu.edu/~dredden/512s17/
Textbook: I will be using the course notes "Error-correcting Codes" from Franz Lemmermeyer, available on his website at http://www.fen.bilkent.edu.tr/~franz/lect/codes.pdf. I will also follow the book "A First Course in Coding Theory" by Raymond Hill and give appropriate references, but it is not required that you purchase the book.
Grading Scheme:
| Attendance | 10% |
| Homework | 20% |
| Quizzes | 40% |
| Final Exam | 30% |
Homework: http://myweb.liu.edu/~dredden/512s17/Homework.pdf Homework will be assigned weekly. It will be discussed and and checked during the following week's class. You can also upload the homework at https://dropitto.me/Math521, using the password "hw".
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/1. 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.
Course description for this semester: This course will cover 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.