What LDPC codes are: low-density parity-check codes used in 5G and WiFi

Shannon's channel capacity: C = B log₂(1 + S/N) bits per second

Shannon's formula: C = B log₂(1 + S/N) defines channel capacity in bits/s

Reed-Solomon error correction: What is the mathematical formula representing the minimum number of redundant symbols required to correct a given number of symbol errors in a Reed-Solomon code?

Minimum redundant symbols = (2t + 1) * k, where t = (number of symbol errors)/(2t + 1) and k = (codeword length - data length)

Greedy vs beam search decoding: greedy picks best token, beam maintains k candidates

Greedy decoding selects one token, while beam search retains multiple candidates

How the Transformer encoder differs from decoder — encoder is bidirectional, decoder is causal

Transformer encoder processes input bidirectionally, while decoder uses causal (left-to-right) masking

A p-value < 0.05 means: if H₀ is true, this result has <5% probability

A p-value < 0.05 indicates a less than 5% chance of observing data as extreme as this if the null hypothesis is true

What bloom filters do: probabilistically check set membership with no false negatives

Bloom filters: Efficient set membership testing with zero false negatives