Introduction to Coding Theory

Catalog description

Prerequisites: MATH 2450 and either MATH 3000 or MATH 3250 . This course is an introductory course in coding theory. Topics may include linear codes, generator and parity check matrices, dual codes, weight and distance, encoding and decoding, and the Sphere Packing Bound; various examples of codes like the Hamming codes, Golay codes, binary Reed-Muller codes, and the hexacode; Shannon's theorem for the binary symmetric channel, upper and lower bounds on the size of linear and nonlinear codes; constructions and properties of finite fields, basic theory of cyclic codes; concepts of idempotent generator, generator polynomial, zeros of a code, and defining sets, special families of BCH and Reed-Solomon cyclic codes as well as generalized Reed-Solomon codes. Credit cannot be granted for both MATH 4460 and MATH 5460 .