💻 Reed-Muller

Code rate k/n—
Min distance d—
Can correct t—
BER (100 trials)—
RM(1,m) code
n = 2m bits, k = m+1 message bits
min distance = 2m-1
Decoder: majority logic vote over 2m-1 checks per bit
Can correct up to ⌊(d-1)/2⌋ errors