Sign inSign in

Fourier Transform over ℤN\mathbb{Z}_N

A decomposition of a function mapping integers modulo N into complex numbers as linear combinations of discrete pattern functions.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Fourier transform over 𝔽2n\mathbb{F}_2^n1Linear combination1Root of unity1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.