Skip to content

FOLLOW AN IDEA

Hamming distance

Hamming distance counts differing positions between equal-length strings.

Explore concept graph · Explore connected videos

Different ways to understand it

No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video

More concepts to explore

  • Error correction bounds

    Minimum distance d permits correcting up to floor((d-1)/2) arbitrary symbol errors.

  • Linear codes

    Codewords forming a finite-field vector subspace enable algebraic encoding and decoding.

  • Probability

    A probability measure assigns nonnegative weights to events, with total weight one and countable additivity on disjoint events.

  • Source coding

    Source coding represents messages efficiently, with entropy constraining lossless average code length.

  • Channel capacity

    Capacity bounds achievable reliable information rates for a specified channel model.

Back to the complete concept index →

Knowledge connections

Appears in these maps

LEARNING MAP

Information and Coding Theory

Explore information measures; compression and channels; error correction. Concepts and connections are available independently of video coverage.

Scope reference