Sequential decoding for the exponential server timing channel

Rajesh Sundaresan, Sergio Verdú

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-boonded by a finite number. The rate of information transfer for this code is μ/(2e) nats per second, i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2e) nats per second.

Original languageEnglish (US)
Pages (from-to)705-709
Number of pages5
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - 2000

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Sequential decoding for the exponential server timing channel'. Together they form a unique fingerprint.

Cite this