Related papers: Instantons causing iterative decoding to cycle
We extend the worldline instanton technique to compute the vacuum pair production rate for spatially inhomogeneous electric background fields, with the spatial inhomogeneity being genuinely two or three dimensional, both for the magnitude…
Quantum entanglement, a fundamental property ensuring security of key distribution and efficiency of quantum computing, is extremely sensitive to decoherence. Different procedures have been developed in order to recover entanglement after…
The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum…
The iterative Boltzmann inversion is an iterative scheme to determine an effective pair potential for an ensemble of identical particles in thermal equilibrium from the corresponding radial distribution function. Although the method is…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such…
We look for instanton solutions in a class of two scalar field gravity models, which includes the low energy string action in four dimensions. In models where the matter field has a potential with a false vacuum, we find that non-singular…
Hinging on ideas from physical-layer network coding, some promising proposals of coded random access systems seek to improve system performance (while preserving low complexity) by means of packet repetitions and decoding of linear…
We examine the contribution of small instantons to the axion mass in various UV completions of QCD. We show that the reason behind the potential dominance of such contributions is the non-trivial embedding of QCD into the UV theory. The…
The shortest distance between the first $n$ iterates of a typical point can be quantified with a log rule for some dynamical systems admitting Gibbs measures. We show this in two settings. For topologically mixing Markov shifts with at most…
It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the…
We investigate errors in tangents and adjoints of implicit functions resulting from errors in the primal solution due to approximations computed by a numerical solver. Adjoints of systems of linear equations turn out to be unconditionally…
An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
Instantons in massless theories do not carry over to massive theories due to Derrick's theorem. This theorem can, however, be circumvented, if a constraint that restricts the scale of the instanton is imposed on the theory. Constrained…
We derive lower and upper bounds on the identification capacity of inverse Gaussian channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time…
A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…