In the modern world, transmission of information is vital. Many methods used to transmit data, however, are susceptible to outside influences that can cause errors. For example, information sent via phone lines can be corrupted by lightening. Algebraic Error-Correcting Codes provide an elegant and efficient way of dealing with these errors. This course will be an introduction to this topic. Although the mathematical tools for designing error-correcting codes (groups, rings, fields, vector spaces) are studied in their own right, we will focus on the applications of these theoretical concepts to coding theory. The course will cover various types of codes including repetition codes, parity check codes, linear codes, Hamming codes and generalized Reed-Solomon codes. Format: lecture. Evaluation will be based primarily on performance on homework assignments and exams. Prerequisites: Mathematics 312, or Mathematics 315 and permission of instructor. No enrollment limit (expected: 20).