Sequential decoding for the exponential server timing channel

Rajesh Sundaresan; Sergio Verdú

doi:10.1109/18.825847

Sequential decoding for the exponential server timing channel

Rajesh Sundaresan, Sergio Verdú

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	705-709
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	2
DOIs	https://doi.org/10.1109/18.825847
State	Published - 2000

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.825847

Cite this

@article{6f2edfcfa2b747bbbe8a881723d2bcfa,

title = "Sequential decoding for the exponential server timing channel",

abstract = "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.",

author = "Rajesh Sundaresan and Sergio Verd{\'u}",

note = "Funding Information: Manuscript received December 21, 1998; revised Septepmber 23, 1999. This work was supported in part by the National Science Foundation under Grant NCR-9523805 002. The authors are with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA. Communicated by T. E. Fuja, Associate Editor At Large. Publisher Item Identifier S 0018-9448(00)01690-4.",

year = "2000",

doi = "10.1109/18.825847",

language = "English (US)",

volume = "46",

pages = "705--709",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Sequential decoding for the exponential server timing channel

AU - Sundaresan, Rajesh

AU - Verdú, Sergio

N1 - Funding Information: Manuscript received December 21, 1998; revised Septepmber 23, 1999. This work was supported in part by the National Science Foundation under Grant NCR-9523805 002. The authors are with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA. Communicated by T. E. Fuja, Associate Editor At Large. Publisher Item Identifier S 0018-9448(00)01690-4.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033889530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033889530&partnerID=8YFLogxK

U2 - 10.1109/18.825847

DO - 10.1109/18.825847

M3 - Article

AN - SCOPUS:0033889530

SN - 0018-9448

VL - 46

SP - 705

EP - 709

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

Sequential decoding for the exponential server timing channel

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this