How quickly can we approach channel capacity?

Dror Baron, Mohammad Ali Khojastepour, Richard G. Baraniuk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

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 languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
EditorsM.B. Matthews
Pages1096-1100
Number of pages5
Volume1
StatePublished - 2004
EventConference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 7 2004Nov 10 2004

Other

OtherConference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period11/7/0411/10/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'How quickly can we approach channel capacity?'. Together they form a unique fingerprint.

Cite this