Description
Introduction to field theory, emphasizing the structure of finite fields, primitive elements and irreducible polynomials. The influence of computational problems will be considered. Theory and applications of error-correcting codes: algebraic codes, convolution codes, decoding algorithms, and analysis of code performance.
Prerequisites
- Prerequisite(s): MATH 2100 , or MATH 3101 or MATH 2108 or equivalent; or permission of the School.
Conditions and arrangements
- Prerequisite(s): MATH 2100 , or MATH 3101 or MATH 2108 or equivalent; or permission of the School.
- Lectures three hours a week.
Reference text in its original language
Introduction to field theory, emphasizing the structure of finite fields, primitive elements and irreducible polynomials. The influence of computational problems will be considered. Theory and applications of error-correcting codes: algebraic codes, convolution codes, decoding algorithms, and analysis of code performance.
- Prerequisite(s): MATH 2100 , or MATH 3101 or MATH 2108 or equivalent; or permission of the School.
- Lectures three hours a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/