Related papers: On Parameterized Gallager's First Bounds for Binar…
The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance $1/2 -\epsilon$ and rate $\Omega(\epsilon^2)$ (where an upper bound of $O(\epsilon^2\log(1/\epsilon))$ is known). Ta-Shma [STOC 2017]…
The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's…
In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…
Checking that a scalar potential is bounded from below (BFB) is an ubiquitous and notoriously difficult task in many models with extended scalar sectors. Exact analytic BFB conditions are known only in simple cases. In this work, we present…
We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter output is constrained to be symmetric binary (bi-polar). In this work we improve the original Ozarov-Wyner-Ziv (OWZ)…
The modeling and simulation of electromagnetic wave propagation is often accompanied by a restriction to bounded domains which requires the introduction of artificial boundaries. The corresponding boundary conditions should be chosen in…
Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert--Varshamov lower bound on the…
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been…
A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a…
We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…
Astrometry, the precise measurement of stellar positions and velocities, offers a promising approach to probing the low-frequency stochastic gravitational wave background (SGWB). Notably, astrometric vector sky maps are sensitive to…
Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…
The recent detection of a common-spectrum stochastic signal by multiple pulsar timing array (PTA) collaborations has provided tentative evidence for a nanohertz (nHz) stochastic gravitational-wave background (SGWB). This signal can be…
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…
We develop and analyze strategies to couple the discontinuous Petrov-Galerkin method with optimal test functions to (i) least-squares boundary elements and (ii) various variants of standard Galerkin boundary elements. Essential feature of…
We investigate in this paper the existence of the leading profile of a WKB expansion for quasilinear initial boundary value problems with a highly oscillating forcing boundary term. The framework is weakly nonlinear, as the boundary term is…
A global network of laser interferometric gravitational wave detectors is projected to be in operation by around the turn of the century. Here, the noisy output of a single instrument is examined. A gravitational wave is assumed to have…
Finding fast polarizing transforms is an important problem as polar codes suffer from slow finitelength performance. This paper considers non binary polar codes for transmission over the AWGN channel and designs polarizing transforms with…
We revisit the linear programming bounds for the size vs. distance trade-off for binary codes, focusing on the bounds for the almost-balanced case, when all pairwise distances are between $d$ and $n-d$, where $d$ is the code distance and…
This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…