Finite Block-Length Achievable Rates for Queuing Timing Channels

While most communication systems convey information by controlling the amplitudes of signals at each time instant, information can also be sent by controlling the timing at which events occur. The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, the authors discuss practical finite-length restrictions on the code-words and attempt to understand the amount of maximal rate that can be achieved for a target error probability.

Provided by: University of Idaho Topic: Networking Date Added: May 2011 Format: PDF

Find By Topic