Show simple item record

dc.contributor.authorBaron, Dror
Khojastepour, Mohammad
Baraniuk, Richard G.
dc.creatorBaron, Dror
Khojastepour, Mohammad
Baraniuk, Richard G. 2007-10-31T00:36:35Z 2007-10-31T00:36:35Z 2004-11-01 2004-11-01
dc.identifier.citation D. Baron, M. Khojastepour and R. G. Baraniuk, "How Quickly Can We Approach Channel Capacity?," vol. 1, 2004.
dc.description Conference Paper
dc.description.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 nonasymptotic capacity C/sub NA/(n, /spl epsi/) as the maximal rate of codebooks that achieve a probability /spl epsi/ of codeword error while using codewords of length n. We prove for the binary symmetric channel that C/sub NA/(n,/spl epsi/)=C-K(/spl epsi/)//spl radic/n+o(1//spl radic/n), where K(/spl epsi/) 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.
dc.language.iso eng
dc.subject.otherDSP for Communications
dc.title How Quickly Can We Approach Channel Capacity?
dc.type Conference paper 2006-06-06
dc.citation.bibtexName inproceedings 2006-06-06
dc.contributor.orgDigital Signal Processing (
dc.citation.volumeNumber 1
dc.citation.location Pacific Grove, CA
dc.citation.conferenceName Asilomar Conference on Signals, Systems, and Computers
dc.type.dcmi Text
dc.type.dcmi Text
dc.citation.firstpage 1096
dc.citation.lastpage 1100

Files in this item


This item appears in the following Collection(s)

  • DSP Publications [508]
    Publications by Rice Faculty and graduate students in digital signal processing.
  • ECE Publications [1401]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students

Show simple item record