Channel capacity

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

Different ways to understand it

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

Huffman coding
A greedy merging procedure builds an optimal binary prefix code for given symbol probabilities.
Source coding
Source coding represents messages efficiently, with entropy constraining lossless average code length.
Conditional entropy
Conditional entropy averages remaining uncertainty after another variable is observed.
Error correction bounds
Minimum distance d permits correcting up to floor((d-1)/2) arbitrary symbol errors.
Hamming distance
Hamming distance counts differing positions between equal-length strings.