Random coding of channel decoding with an erasure option is studied. By analyzing the large deviations behavior of the code ensemble, we obtain exact single-letter formulas for the error exponents in lieu of Forney’s lower bounds. The analysis technique we use is based on an enhancement and specialization of tools for assessing the moments of certain distance enumerators. We specialize our resu...

For information transmission, a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes (without delay) all outputs of the forward channel via the feedback channel. Transmission of nonexponentially many messages is considered (i.e., the transmission rate is zero). The achievable decoding error exponent for this comb...

The exponent of periodicity is a key parameter used in all currently known algorithms for solving word equations. A lower bound for it is 2c|E|, where |E| is the length of the equation E. We prove that in fixed dimension, i.e., when the variables belong to a fixed set V , the exponent of periodicity can be bound by a polynomial p(|E|) of degree no more than thrice the size of the set V .

The impact of causality on information-theoretic source and channel coding problems by Harikrishna R. Palaiyanur Doctor of Philosophy in Engineering — Electrical Engineering and Computer Sciences University of California, Berkeley Professor Anant Sahai, Chair This thesis studies several problems in information theory where the notion of causality comes into play. Causality in information theory...

Purpose – The purpose of this research is to analyze empirically the structure of the Web2.0 service network and the mechanism behind its evolution over time. Design/Methodology/Approach – Based on the list of Web2.0 services and their Mashups that is announced on www.programmableweb.com, a network of Web2.0 services was constructed. Within this network, a node represents a Web2.0 service with ...

The relationship between cerebral blood volume (CBV) and flow (CBF) has been widely studied. One of the most significant early studies was by Grubb et al (1974 Stroke 5 630-9), who conducted hypercapnia studies in primates with positron emission tomography (PET) and empirically found CBV = 0.8 CBF(0.38). The exponent used here has since been known as the Grubb's exponent. In this paper, we defi...

In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) and thus results in a tighter sphere-packing exponent when compared to the tightest known...

The lower-critical dimension for the existence of the Ising spin-glass phase is calculated, numerically exactly, as dL=2.520 for a family of hierarchical lattices, from an essentially exact (correlation coefficent R2=0.999999) near-linear fit to 23 different diminishing fractional dimensions. To obtain this result, the phase transition temperature between the disordered and spin-glass phases, t...

The maximal Lyapunov exponent of a nonsmooth system is the lower bound for the proportional feedback gain necessary to achieve full state synchronization. In this paper, we prove this statement for the general class of nonsmooth systems in the framework of measure differential inclusions. The results are used to estimate the maximal Lyapunov exponent using chaos synchronization, which is illust...