Information and Coding Theory
Explore information measures; compression and channels; error correction. Concepts and connections are available independently of video coverage.
FOLLOW AN IDEA
Minimum distance d permits correcting up to floor((d-1)/2) arbitrary symbol errors.
Explore concept graph · Explore connected videos
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
Hamming distance counts differing positions between equal-length strings.
A parity-check matrix produces a syndrome that diagnoses violations of code constraints.
Capacity bounds achievable reliable information rates for a specified channel model.
Conditional entropy averages remaining uncertainty after another variable is observed.
A greedy merging procedure builds an optimal binary prefix code for given symbol probabilities.
Explore information measures; compression and channels; error correction. Concepts and connections are available independently of video coverage.