Coding theory. Codes (linear, Hamming, Golay, dual); decoding-encoding; Shannon's theorem; sphere-packing; singleton and Gilbert-Varshamov bounds; weight enumerators; MacWilliams identities; finite fields; other codes (Reed-Muller, cyclic, BCH, Reed-Solomon) and error-correction algorithms.
credits:
3 (N-A)
semester:
InFrequent
prereqs:
MATH 541 or graduate or professional standing or member of the Pre-Masters Mathematics (Visiting International) Program