On the reliability exponent of the geometric server timing channel

Guy Nakibly, Shraga I. Bross

Research output: Contribution to journalConference articlepeer-review

Abstract

The reliability exponent E(R) of the Bedekar-Azizog̃lu discrete-time geometric-server timing channel with service rate μ packets per slot is determined for all rates R between the critical rate Rc and the channel capacity. For rates between 0 and Rc, we provide a random-coding lower bound Er(R) and a sphere-packing upper bound Esp(R) on E(R).

Original languageEnglish
Pages (from-to)445
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004

Fingerprint

Dive into the research topics of 'On the reliability exponent of the geometric server timing channel'. Together they form a unique fingerprint.

Cite this