Peter Shor
Professor of Applied Mathematics · MIT · Breakthrough Laureate
Peter Shor is Morss Professor of Applied Mathematics at MIT, creator of Shor's quantum factoring algorithm.
- lectures
- 9
- series
- 1
- hours
- 11
Start here
Series and courses
MIT 18.200: Principles of Discrete Applied Mathematics
In these lectures
- Reed-Solomon codes represent messages as polynomials over finite fields, evaluating them at distinct points to generate codewords.Reed-Solomon Codes
- Cayley's tree theorem states that there are labeled trees on vertices.More Counting and Generating Functions
- Shannon's noisy channel coding theorem states that error rates go to zero as block lengths go to infinity, provided the rate is below channel capacity.Error-Correcting Codes—Hamming Codes
Draws on
People cited in the lectures, at the moment of the citation.
- Professor MoitraMentioned as having discussed finite fields for prime powers previously.
- Professor MovaInstructor giving the upcoming non-exam lectures.
- Robert BixbyFounder of a company in 1987 who wrote CPLEX, a linear programming tool.
- Dan SpielmanProfessor at MIT at the time, co-inventor of smoothed analysis.
- Richard StanleyFormer professor at MIT, combinatorialist known for studying Catalan numbers.
- Dick WilfHerbert Wilf, cited for previous work on Catalan numbers.
About
Peter Shor is Morss Professor of Applied Mathematics at MIT, creator of Shor's quantum factoring algorithm. His undergraduate MIT 18.200 lectures derive Catalan numbers by generating functions, build Hamming and Reed-Solomon codes, and prove max-flow min-cut by linear programming duality.
Taught with
Same subject, Mathematics
Connections
14Their places, courses, books and lectures.


