Related papers: Instantons causing iterative decoding to cycle
It is shown that the contribution of the instantons to the fragmentation of quarks leads to the appearance of a imaginary part in diagrams of quark-quark scattering at large transfer momentum. The imaginary part comes from the analytical…
The role of instantons is investigated in the Lagrangian model for the velocity gradient evolution known as the Recent Fluid Deformation approximation. After recasting the model into the path-integral formalism, the probability distribution…
In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence…
We study the instantons describing the production of particles at the ends of codimension-one objects (strings and struts) in $(2+1)$-dimensional Minkowski and de Sitter spaces. A Minkowskian background allows only for systems with…
We show how to do semiclassical nonperturbative computations within the worldline approach to quantum field theory using ``worldline instantons''. These worldline instantons are classical solutions to the Euclidean worldline loop equations…
The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping…
For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall…
Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result…
The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…
For arbitrary gauge groups, we check at the one-instanton level that the Nekrasov partition function of pure N=2 super Yang-Mills is equal to the norm of a certain coherent state of the corresponding W-algebra. For non-simply-laced gauge…
We investigate the confinement properties in the multi-instanton system, where the size distribution is assumed to be $ \rho^{-5} $ for the large instanton size $ \rho $. We find that the instanton vacuum gives the area law behavior of the…
The explicit multi-instanton solutions by 'tHooft and Jackiw, Nohl & Rebbi are generalized to curvilinear coordinates. The idea is that a gauge transformation can notably simplify the expressions obtained after the change of variables. The…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
The axion Weak Gravity Conjecture implies that when parametrically increasing the axion decay constants, instanton corrections become increasingly important. We provide strong evidence for the validity of this conjecture by studying the…
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix…
This work constructs codes that are efficiently decodable from a constant fraction of \emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
Convergence of classical parallel iterations is detected by performing a reduction operation at each iteration in order to compute a residual error relative to a potential solution vector. To efficiently run asynchronous iterations,…
Asynchronous iterative methods tolerate straggling processors by allowing workers to proceed with stale data, but at a cost: the iterates become inconsistent, potentially degrading convergence. We investigate whether convergence…
In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar…