Related papers: On Parameterized Gallager's First Bounds for Binar…
We explore the relation between the techniques of statistical mechanics and information theory for assessing the performance of channel coding. We base our study on a framework developed by Gallager in {\em IEEE Trans. Inform. Theory} {\bf…
The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut…
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…
This paper investigates the thinned Bernoulli field (TBF) on the one-dimensional integer lattice, where isolated occupied sites are removed from a standard Bernoulli configuration with density $p$. Our present work complements previous…
We consider minimizers of the one-phase Bernoulli free boundary problem in domains with analytic fixed boundary. In any dimension $d$, we prove that the branching set at the boundary has Hausdorff dimension at most $d-2$. As a consequence,…
Let $\text{AGL}(1,\Bbb F_q)$ be the affine linear group of dimension $1$ over a finite field $\Bbb F_q$. $\text{AGL}(1,\Bbb F_q)$ acts sharply 2-transitively on $\Bbb F_q$. Given $S<\text{AGL}(1,\Bbb F_q)$ and an integer $k$ with $1\le k\le…
For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…
Maximally dissipative boundary conditions are applied to the initial-boundary value problem for Einstein's equations in harmonic coordinates to show that it is well-posed for homogeneous boundary data and for boundary data that is small in…
A new geometric shaping technique, referred to as coset shaping, is proposed and analyzed for coded QAM and PAM signaling. This method can be applied to both information and parity bits without introducing additional complexity. It is shown…
In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilots,…
The subject is parametrices for semi-linear problems, based on parametrices for linear boundary problems and on non-linearities that decompose into solution-dependent linear operators acting on the solutions. Non-linearities of product type…
It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
We explore the ability of overparameterized shallow neural networks to learn Lipschitz regression functions with and without label noise when trained by Gradient Descent (GD). To avoid the problem that in the presence of noisy labels,…
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…
Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\tilde{O}(n^{1+\delta})$ bits. There is an inherent tradeoff between the…
We investigate a framework for extracting parameters of stochastic gravitational wave background (SGWB) with peak-like templates in the millihertz frequency band, and analyzing transient contamination effects on parameter reconstruction. We…
BA-type supergiants show a high potential as versatile indicators for modern astronomy. The focus here is on the determination of accurate and precise atmospheric parameters for a sample of 35 Galactic BA-type supergiants. Some first…
Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper we identify code parameters…
Although for a number of semilinear stochastic wave equations existence and uniqueness results for corresponding solution processes are known from the literature, these solution processes are typically not explicitly known and numerical…