499 research outputs found
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
This monograph presents a unified treatment of single- and multi-user
problems in Shannon's information theory where we depart from the requirement
that the error probability decays asymptotically in the blocklength. Instead,
the error probabilities for various problems are bounded above by a
non-vanishing constant and the spotlight is shone on achievable coding rates as
functions of the growing blocklengths. This represents the study of asymptotic
estimates with non-vanishing error probabilities.
In Part I, after reviewing the fundamentals of information theory, we discuss
Strassen's seminal result for binary hypothesis testing where the type-I error
probability is non-vanishing and the rate of decay of the type-II error
probability with growing number of independent observations is characterized.
In Part II, we use this basic hypothesis testing result to develop second- and
sometimes, even third-order asymptotic expansions for point-to-point
communication. Finally in Part III, we consider network information theory
problems for which the second-order asymptotics are known. These problems
include some classes of channels with random state, the multiple-encoder
distributed lossless source coding (Slepian-Wolf) problem and special cases of
the Gaussian interference and multiple-access channels. Finally, we discuss
avenues for further research.Comment: Further comments welcom
Asymmetric Evaluations of Erasure and Undetected Error Probabilities
The problem of channel coding with the erasure option is revisited for
discrete memoryless channels. The interplay between the code rate, the
undetected and total error probabilities is characterized. Using the
information spectrum method, a sequence of codes of increasing blocklengths
is designed to illustrate this tradeoff. Furthermore, for additive discrete
memoryless channels with uniform input distribution, we establish that our
analysis is tight with respect to the ensemble average. This is done by
analysing the ensemble performance in terms of a tradeoff between the code
rate, the undetected and the total errors. This tradeoff is parametrized by the
threshold in a generalized likelihood ratio test. Two asymptotic regimes are
studied. First, the code rate tends to the capacity of the channel at a rate
slower than corresponding to the moderate deviations regime. In this
case, both error probabilities decay subexponentially and asymmetrically. The
precise decay rates are characterized. Second, the code rate tends to capacity
at a rate of . In this case, the total error probability is
asymptotically a positive constant while the undetected error probability
decays as for some . The proof techniques involve
applications of a modified (or "shifted") version of the G\"artner-Ellis
theorem and the type class enumerator method to characterize the asymptotic
behavior of a sequence of cumulant generating functions.Comment: 28 pages, no figures in IEEE Transactions on Information Theory, 201
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
To reduce computational complexity and delay in randomized network coded
content distribution, and for some other practical reasons, coding is not
performed simultaneously over all content blocks, but over much smaller,
possibly overlapping subsets of these blocks, known as generations. A penalty
of this strategy is throughput reduction. To analyze the throughput loss, we
model coding over generations with random generation scheduling as a coupon
collector's brotherhood problem. This model enables us to derive the expected
number of coded packets needed for successful decoding of the entire content as
well as the probability of decoding failure (the latter only when generations
do not overlap) and further, to quantify the tradeoff between computational
complexity and throughput. Interestingly, with a moderate increase in the
generation size, throughput quickly approaches link capacity. Overlaps between
generations can further improve throughput substantially for relatively small
generation sizes.Comment: To appear in IEEE Transactions on Information Theory Special Issue:
Facets of Coding Theory: From Algorithms to Networks, Feb 201
Linear stability of planar premixed flames: reactive Navier-Stokes equations with finite activation energy and arbitrary Lewis number
A numerical shooting method for performing linear stability analyses of travelling waves is described and applied to the problem of freely propagating planar premixed flames. Previous linear stability analyses of premixed flames either employ high activation temperature asymptotics or have been performed numerically with finite activation temperature, but either for unit Lewis numbers (which ignores thermal-diffusive effects) or in the limit of small heat release (which ignores hydrodynamic effects). In this paper the full reactive Navier-Stokes equations are used with arbitrary values of the parameters (activation temperature, Lewis number, heat of reaction, Prandtl number), for which both thermal-diffusive and hydrodynamic effects on the instability, and their interactions, are taken into account. Comparisons are made with previous asymptotic and numerical results. For Lewis numbers very close to or above unity, for which hydrodynamic effects caused by thermal expansion are the dominant destablizing mechanism, it is shown that slowly varying flame analyses give qualitatively good but quantitatively poor predictions, and also that the stability is insensitive to the activation temperature. However, for Lewis numbers sufficiently below unity for which thermal-diffusive effects play a major role, the stability of the flame becomes very sensitive to the activation temperature. Indeed, unphysically high activation temperatures are required for the high activation temperature analysis to give quantitatively good predictions at such low Lewis numbers. It is also shown that state-insensitive viscosity has a small destabilizing effect on the cellular instability at low Lewis numbers
- …