MTH 512

**Class Time:** Monday 5:00p - 7:40p, Humanities 122.

**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.cwpost.liu.edu/dredden/512s15/

**Homework:** http://myweb.cwpost.liu.edu/dredden/512s15/Homework.pdf

**Homework Solutions:** 1, 2, 3, 4, 5, 6, 7, 8, 9, Test 1, Test 1 Solutions, Test 2, Test 2 Solutions

**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:**

Homework | 30% |

2 Tests | 40% |

Final Exam | 30% |

**Homework:** Weekly homework will be assigned, collected, and graded. Each homework will be graded out of 10 points, with 4 points being given for completeness and 6 points for correctness of specific problems that I choose to grade. You are encouraged to work with others on the homework, but you must write up the assignment on your own. I will deduct points when it appears that you have copied someone else's work. The lowest two homework scores will be dropped. Late homework will only be accepted if I have not yet graded the assignment.

**Tests:** There will be 2 short tests (3/2 and 4/13) during the first part of class, approximately 5-6p. After a short break, class will resume at approximately 6:15p.

**Final Exam:** The final examination will be CUMULATIVE, and will occur during the usual class time on Monday 5/4. 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.

**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, Gšdel's incompleteness theorem, coding, error-correcting codes, information and entropy. (*3 credits*)

**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.

**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:**

Tues Jan 20 | Classes begin. |

Wed Feb 4 | Last day to add/drop or late register. |

Mon Feb 16 | No classes. President's Day. |

Tues Feb 17 | Monday classes meet. |

Mon Mar 2 | Test 1 |

Mar 9-15 | Spring recess, no classes. |

Fri Apr 3 | Last day to opt for P/F or withdraw. |

Mon Apr 13 | Test 2 |

Tues Apr 28 | Last day of regular classes. |

Mon May 4 | Final Exam |