How closely can we approach the Shannon limit in practical channels?

Shannon's noisy-channel theorem (1948) sets a fundamental upper bound on reliable communication rate. LDPC and polar codes approach this bound at finite block lengths.

Open engineering questions include short-block performance, rate-distortion in semantic communication, and codes for non-stationary or adversarial channels.