APC 529 / ELE 529
Coding Theory and Random Graphs
This introductory course to coding theory and random graphs covers the basics in each field and the interplay between them. The coding part covers algebraic codes, distance bounds, polar codes, expander codes and LDPC codes. The random graph part covers threshold phenomena, connectivity, giant component, subgraph containment and sharp thresholds. Recent developments in random CSPs and community detection are also discussed, in particular the stochastic block model. The class is proof oriented. Some of the techniques presented are currently used in real-world applications, while others lie at the heart of network data science.
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.
|21796||L01||4:30 pm - 5:50 pm||T||Fine Hall 224||Enrolled:2 Limit:20|
|21796||L01||9:30 am - 10:50 am||Th||Fine Hall 322||Enrolled:2 Limit:20|