493 research outputs found
Second-Order Coding Rates for Channels with State
We study the performance limits of state-dependent discrete memoryless
channels with a discrete state available at both the encoder and the decoder.
We establish the epsilon-capacity as well as necessary and sufficient
conditions for the strong converse property for such channels when the sequence
of channel states is not necessarily stationary, memoryless or ergodic. We then
seek a finer characterization of these capacities in terms of second-order
coding rates. The general results are supplemented by several examples
including i.i.d. and Markov states and mixed channels
A Tractable Approach to Coverage and Rate in Cellular Networks
Cellular networks are usually modeled by placing the base stations on a grid,
with mobile users either randomly scattered or placed deterministically. These
models have been used extensively but suffer from being both highly idealized
and not very tractable, so complex system-level simulations are used to
evaluate coverage/outage probability and rate. More tractable models have long
been desirable. We develop new general models for the multi-cell
signal-to-interference-plus-noise ratio (SINR) using stochastic geometry. Under
very general assumptions, the resulting expressions for the downlink SINR CCDF
(equivalent to the coverage probability) involve quickly computable integrals,
and in some practical special cases can be simplified to common integrals
(e.g., the Q-function) or even to simple closed-form expressions. We also
derive the mean rate, and then the coverage gain (and mean rate loss) from
static frequency reuse. We compare our coverage predictions to the grid model
and an actual base station deployment, and observe that the proposed model is
pessimistic (a lower bound on coverage) whereas the grid model is optimistic,
and that both are about equally accurate. In addition to being more tractable,
the proposed model may better capture the increasingly opportunistic and dense
placement of base stations in future networks.Comment: Submitted to IEEE Transactions on Communication
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this paper is the long-standing open problem of developing a
general capacity theory for wireless networks, particularly a theory capable of
describing the fundamental performance limits of mobile ad hoc networks
(MANETs). A MANET is a peer-to-peer network with no pre-existing
infrastructure. MANETs are the most general wireless networks, with single-hop,
relay, interference, mesh, and star networks comprising special cases. The lack
of a MANET capacity theory has stunted the development and commercialization of
many types of wireless networks, including emergency, military, sensor, and
community mesh networks. Information theory, which has been vital for links and
centralized networks, has not been successfully applied to decentralized
wireless networks. Even if this was accomplished, for such a theory to truly
characterize the limits of deployed MANETs it must overcome three key
roadblocks. First, most current capacity results rely on the allowance of
unbounded delay and reliability. Second, spatial and timescale decompositions
have not yet been developed for optimally modeling the spatial and temporal
dynamics of wireless networks. Third, a useful network capacity theory must
integrate rather than ignore the important role of overhead messaging and
feedback. This paper describes some of the shifts in thinking that may be
needed to overcome these roadblocks and develop a more general theory that we
refer to as non-equilibrium information theory.Comment: Submitted to IEEE Communications Magazin
Cryptographic error correction
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (leaves 67-71).It has been said that "cryptography is about concealing information, and coding theory is about revealing it." Despite these apparently conflicting goals, the two fields have common origins and many interesting relationships. In this thesis, we establish new connections between cryptography and coding theory in two ways: first, by applying cryptographic tools to solve classical problems from the theory of error correction; and second, by studying special kinds of codes that are motivated by cryptographic applications. In the first part of this thesis, we consider a model of error correction in which the source of errors is adversarial, but limited to feasible computation. In this model, we construct appealingly simple, general, and efficient cryptographic coding schemes which can recover from much larger error rates than schemes for classical models of adversarial noise. In the second part, we study collusion-secure fingerprinting codes, which are of fundamental importance in cryptographic applications like data watermarking and traitor tracing. We demonstrate tight lower bounds on the lengths of such codes by devising and analyzing a general collusive attack that works for any code.by Christopher Jason Peikert.Ph.D
On Capacity Regions of Discrete Asynchronous Multiple Access Channels
A general formalization is given for asynchronous multiple access channels
which admits different assumptions on delays. This general framework allows the
analysis of so far unexplored models leading to new interesting capacity
regions. In particular, a single letter characterization is given for the
capacity region in case of 3 senders, 2 synchronous with each other and the
third not synchronous with them.Comment: It has been presented in part at ISIT 2011, Saint Petersburg. This
extended version is accepted for publication in Kybernetik
- …