Sign inSign in

Hamming weight

The number of non-zero elements in a string, which for binary strings is the number of ones.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 7 definitions
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

3

Each in their own terms, from the easiest level.

  • Peter Shor

    MIT · Undergraduate

    The Hamming weight of a vector is the number of non-zero elements it contains.
    • 13:43Reed-Solomon Codes
    • 22:41Error-Correcting Codes—Hamming Codes
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 27:19Analysis of Boolean Functions: Additive Combinatorics
    • 16:05Linear Error Correcting Codes
    • 1:06:16The Exponential Time Hypothesis: Foundations of Computational Hardness
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    The number of symbols that are different from the zero-symbol of the alphabet, used here to count the number of 1-bits in a bit-slice.
    • 1:08:35Data Formats & Encoding Part 2

Lectures that assume it

2

Connections

18

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

3 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.