How quickly can we approach channel capacity?

Recent progress in code design has made it crucial to understand how quickly communication systems can approach their limits. To address this issue for the channel capacity C, we define the non-asymptotic capacity C-NA (n, epsilon) as the maximal rate of codebooks that achieve a probability epsilon of codeword error while using codewords of length n. We prove for the binary symmetric channel that C-NA (n, epsilon) = C - K (epsilon)/root n + o(1/root n), where K (epsilon) is available in closed form. We also describe similar results for the Gaussian channel. These results may lead to more efficient resource usage in practical communication systems.