APC 529 / ELE 536
Coding Theory and Random Graphs
This is an introductory course to coding theory, which also covers topics in random graphs theory. The class discusses several of the major techniques developed in coding theory from the early 50's until recent years. These techniques rely on a variety of probabilistic, algebraic and combinatorial tools, and some are currently used to efficiently compress and transmit information in real-world applications. The class will put emphasis on the algorithmic and mathematical results. Topics included: algebraic codes, polar codes, sparse graph codes, sparse random graphs, threshold phenomena and random combinatorial optimization.
Sample reading list:
See instructor for complete list
See instructor for assignments
Take Home Final Exam - 30%
Problem set(s) - 70%
Prerequisites and Restrictions:
Linear algebra and some exposure to probability theory.
|23332||L01||4:30 pm - 5:50 pm||T||Fine Hall 214||Enrolled:17 Limit:25|
|23332||L01||9:00 am - 10:20 am||Th||Fine Hall 322||Enrolled:17 Limit:25|