article · IEEE Transactions on Information Theory · 2000

Sequential decoding for the exponential server timing channel

Cited by 32Abstract and details only

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-bounded by a finite number. The rate of information transfer for this code is /spl mu//(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least /spl mu//(2u) nats per second.

Cite this paper

APA 7

Sundaresan, R., & Verdú, S. (2000). Sequential decoding for the exponential server timing channel. IEEE Transactions on Information Theory, 46(2), 705–709. https://doi.org/10.1109/18.825847

MLA 9

Sundaresan, Rajesh, and Sergio Verdú. “Sequential decoding for the exponential server timing channel.” IEEE Transactions on Information Theory, vol. 46, no. 2, 2000, pp. 705–09, https://doi.org/10.1109/18.825847.

Chicago

Sundaresan, Rajesh, and Sergio Verdú. 2000. “Sequential decoding for the exponential server timing channel.” IEEE Transactions on Information Theory 46 (2): 705–09. https://doi.org/10.1109/18.825847.

Harvard

Sundaresan, R. and Verdú, S. (2000) ‘Sequential decoding for the exponential server timing channel’, IEEE Transactions on Information Theory, 46(2), pp. 705–709. Available at: https://doi.org/10.1109/18.825847.

BibTeX

@article{sundaresan2000sequential,
  title = {{Sequential decoding for the exponential server timing channel}},
  author = {Sundaresan, Rajesh and Verdú, Sergio},
  journal = {IEEE Transactions on Information Theory},
  volume = {46},
  number = {2},
  pages = {705--709},
  year = {2000},
  doi = {10.1109/18.825847}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.