ENEE 626: ERROR CORRECTING CODES
Graduate course for 1st – 2nd
year students in EE, CS, Applied Math
Instructor : Alexander
Department of Electrical and Computer Engineering/Institute for Systems Research
Office: 2361 A.V.Williams Building Tel. (301) 405 7135 E-mail abarg at umd dot edu
Class times: Tuesday, Thursday 3:30-4:45pm
Instructor availability outside class hours: I am in my office most of the time: arrange to see me after class
• General properties of linear codes. Matrix description, error correction, minimum distance, syndrome decoding. Bounds on codes.
• Channel capacity, capacity-achieving families: Polar codes, LDPC codes
• Finite fields. Reed Solomon codes and their decoding. List decoding algorithms (correct more errors than you can think of). Mathematics of the compact disk.
• Selected problems in cryptography: Secret
sharing schemes, Wire-tap channel, Generating secret keys
• Network coding as alternative to routing: Linear network codes and capacity of multicasting
Grading: several home assignments (20%), class participation (30%), final (50%) (take-home exam).
No required textbook. Recommended: R. Roth, Introduction to coding theory.
Lecture notes: Part I Part II Part III
Prerequisites: Undergraduate linear algebra, probability
Not a prerequisite: Information theory (ENEE627), Digital communications (ENEE 623)