3 units
- Areas of Study
Offered: Summer 2027 (not offered), Spring 2027 (unknown), Fall 2026 (unknown)
Counts toward
- Computer Science, M.S. (2026-27) - Areas of Study
- Computer Science, M.S. (2025-26) - Areas of Study
- Computer Science, M.S. (2024-25) - Areas of Study
Algebraic theory of error correction codes and decoding algorithms used in modern communications systems. Reed-Solomon codes and algebraic decoding algorithms. Code duality, MacWilliam’s identities and the linear programming bound. Probabilistic decoding of convolutional codes, low-density parity-check codes and turbo codes.
Prerequisites
MATH 525 and MATH 520 or MATH 522 with a grade of C (2.0) or better in each course.
Unclear. This wording is not something we can check for you. Read it above and confirm with an adviser.
See the full prerequisite chainFrom the catalog
- Grading
- LTR: Letter Graded. The class will be offered for letter grade with no option to take it for Cr/NC
- Repeatable
- Maximum 3 units.
0 sections in Spring 2027
MATH 625 is not offered in Spring 2027. Check all MATH classes for other terms.