Media Summary: Suppose we are trying to communicate over a "noisy channel." I want to send you a single bit, a 1 or a 0, but there is some ... In this video, we introduce the notion of a Short Talks by Postdoctoral Members Topic: The Geometry of

Nathan Kaplan Codes From Polynomials - Detailed Analysis & Overview

Suppose we are trying to communicate over a "noisy channel." I want to send you a single bit, a 1 or a 0, but there is some ... In this video, we introduce the notion of a Short Talks by Postdoctoral Members Topic: The Geometry of Math Encounters: "Math Encounters: Error-Correcting In the 1930's, in the course of developing non-commutative algebra, Ore introduced a twisted version of Abstract: Many conjectures in number theory have analogues for

Daniel Kane (UCSD) Learning and Testing in High Dimensions. Nick Trefethen, Harvard University, gives the 2026 AMS Josiah Willard Gibbs Lecture on "

Photo Gallery

Nathan Kaplan, "Codes from polynomials over finite fields"
Nathan Kaplan:  Codes from Polynomials Over Finite Fields
Bounds for the Maximal Height of Divisors of $x^n-1$
Polynomial Codes
The Geometry of Polynomials in Algorithms - Nathan Klein
Math Encounters: Error-Correcting Codes: The Mathematics of Communication — N. Kaplan, July 13, 2022
Math Mornings on Sunday - Nathan Kaplan: Points, Lines & Puzzles
Xavier Caruso: Ore polynomials and application to coding theory
Will Sawin: The distribution of prime polynomials over finite fields (NTWS 047)
Tips from a Mathematician: Number Theory & Grad School
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models
Nick Trefethen "Polynomials and Rational Functions"
View Detailed Profile
Nathan Kaplan, "Codes from polynomials over finite fields"

Nathan Kaplan, "Codes from polynomials over finite fields"

Nathan Kaplan

Nathan Kaplan:  Codes from Polynomials Over Finite Fields

Nathan Kaplan: Codes from Polynomials Over Finite Fields

Suppose we are trying to communicate over a "noisy channel." I want to send you a single bit, a 1 or a 0, but there is some ...

Bounds for the Maximal Height of Divisors of $x^n-1$

Bounds for the Maximal Height of Divisors of $x^n-1$

Nathan Kaplan

Polynomial Codes

Polynomial Codes

In this video, we introduce the notion of a

The Geometry of Polynomials in Algorithms - Nathan Klein

The Geometry of Polynomials in Algorithms - Nathan Klein

Short Talks by Postdoctoral Members Topic: The Geometry of

Math Encounters: Error-Correcting Codes: The Mathematics of Communication — N. Kaplan, July 13, 2022

Math Encounters: Error-Correcting Codes: The Mathematics of Communication — N. Kaplan, July 13, 2022

Math Encounters: "Math Encounters: Error-Correcting

Math Mornings on Sunday - Nathan Kaplan: Points, Lines & Puzzles

Math Mornings on Sunday - Nathan Kaplan: Points, Lines & Puzzles

Professor

Xavier Caruso: Ore polynomials and application to coding theory

Xavier Caruso: Ore polynomials and application to coding theory

In the 1930's, in the course of developing non-commutative algebra, Ore introduced a twisted version of

Will Sawin: The distribution of prime polynomials over finite fields (NTWS 047)

Will Sawin: The distribution of prime polynomials over finite fields (NTWS 047)

Abstract: Many conjectures in number theory have analogues for

Tips from a Mathematician: Number Theory & Grad School

Tips from a Mathematician: Number Theory & Grad School

Math Tips: Advising by Professor

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

Daniel Kane (UCSD) https://simons.berkeley.edu/talks/tbd-260 Learning and Testing in High Dimensions.

Nick Trefethen "Polynomials and Rational Functions"

Nick Trefethen "Polynomials and Rational Functions"

Nick Trefethen, Harvard University, gives the 2026 AMS Josiah Willard Gibbs Lecture on "