ENEE 626: Error Correcting Codes. A GRADUATE COURSE FOR 1 ST & 2 ND YEAR STUDENTS IN EE, CS, AMSC Spring 2014, TuTh 2:00-3:15pm 3 Credits I. How to find a false coin? What is the color of your hat? Basic notions of error correction in noisy channels . Linear codes.
A GRADUATE COURSE FOR 1ST & 2ND YEAR STUDENTS IN EE, CS, AMSCSpring 2014, TuTh 2:00-3:15pm 3 CreditsI. How to find a false coin? What is the color of your hat?
Basic notions of error correction in noisy channels. Linear codes.
Code families reaching Shannon’s limit: Polar codes and LDPC codes.
II. How are hard drives protected from errors? Reed-Solomon codes and their decoding(Correct more errors than you can think of)
III. How to transmit securely when the channel is tapped? How to create a secret key? What is secret sharing? (Selected problems in cryptography)
IV. Sending more information over a network link than the link can carry (Network coding)
Prerequisites: Undergraduate Linear Algebra, Probability
INSTRUCTOR: Prof. Alexander Barg, email@example.com
Course page: www.ece.umd.edu/~abarg/626