Sign inSign in
ConceptMathematics

Perfect code

A code where the Hamming balls of radius tt around each code word are disjoint and exactly partition the entire space.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Peter Shor

    MIT · Undergraduate

    One all of whose syndromes correspond to an error of tt bits or fewer.
    • 1:11:11Error-Correcting Codes—Hamming Codes

Connections

8

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

Concepts6

Lectures2

2 lecturers. 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.