Work

Finite block-length achievable rates for queuing timing channels

Year: 2011

Type: conference-paper

Abstract: 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, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a target error probability. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at blocklength n and error probability ϵ. The bound is approximated by C - n-1/2σQ (ϵ) where Q denotes the Q-function and σ2is the asymptotic variance of the underlying Markov chain. A closed form expression for σ2is given.

Source: IEEE Information Theory Workshop (ITW)

DOI: 10.1109/itw.2011.6089377

Authors: Thomas J. Riedl, Todd P. Coleman, Andrew C. Singer

Institution: University of Illinois Urbana-Champaign

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2037580341

FWCI: 1.139

Cites: 27

Cited by: 15

Related to: 10