Abstract
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, ε) as the maximal rate of codebooks that achieve a probability ε of codeword error while using codewords of length n. We prove for the binary symmetric channel that C NA(n, ε) = C - K(ε)/√ + o(l/√n), where K(ε) 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Record - Asilomar Conference on Signals, Systems and Computers |
| Editors | M.B. Matthews |
| Pages | 1096-1100 |
| Number of pages | 5 |
| Volume | 1 |
| State | Published - 2004 |
| Event | Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States Duration: Nov 7 2004 → Nov 10 2004 |
Other
| Other | Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers |
|---|---|
| Country/Territory | United States |
| City | Pacific Grove, CA |
| Period | 11/7/04 → 11/10/04 |
ASJC Scopus subject areas
- General Engineering