Sequential decoding for the exponential server timing channel

Authors:
R. Sundaresan;S. Verdu
Affiliations:
Dept. of Electr. Eng., Princeton Univ., NJ;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

TCP traffic control evaluation and reduction over wireless networks using parallel sequential decoding mechanism

EURASIP Journal on Wireless Communications and Networking
Novel shaping and complexity-reduction techniques for approaching capacity over queuing timing channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	754.84

Visualization

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 μ/(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2u) nats per second