
Text: Trappe & Washington,
Introduction to Cryptography with Coding Theory,
Prentice-Hall, 2nd Ed., 2006Exams: There will be two exams (midterm and final) - dates below - and it will be highly likely that at least one of them will be a take-home.
Homework: Homework will be assigned from the text and also on handout sheets. Specific assignments will be submitted for grading.
Paper: A paper is required in this course. The requirement is to read a research paper in some subject related to the course material and write out the details of the material covered in that paper in your own words.
Project: A project concerning some aspect of the course is required. Either a project which involves the use of a computer or a library bibliography search on a specific topic will satisfy this requirement.
Presentation: A 15-minute presentation to the class on the project or library search topic will be required at the end of the semester.
Grades:
Homework and Exams (60%)
Depth paper in a subject covered in class (20%)
Library Research or Computer Project (10%)
In class presentation of paper or project (10%)
Time Table:
| 1/23 | Introduction : Redundancy and Information Theory ... |
| 3/12 | Mid-term Exam |
| 3/24 - 3/26 | No Classes : Spring Break |
| 4/9 | Papers due |
| 4/16 | Projects due |
| 5/5 | Student Presentations start |
| 5/12 | Final Exam Due |
Syllabus: We shall cover approximately 13 chapters of the book but not all chapters will be covered in full depth. We will examine chapters 1-7, 9-10, 12,15-16 and 18. Chapters not covered in the class are a good starting point for projects and papers.
Note: Any and all of the above is open to negotiation.
|
Spring 2008 CLAS Academic Policies
The following policies pertain to all students and are strictly adhered to by the College of Liberal Arts and Sciences (CLAS).
|
|
Important Dates
|