English
Related papers

Related papers: On Parameterized Gallager's First Bounds for Binar…

200 papers

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most $L$. For odd $L\ge 3$ an asymptotic upper bound on the rate…

Information Theory · Computer Science 2015-12-29 Yury Polyanskiy

We consider the numerical solution of an acoustic scattering problem by the Plane Wave Discontinuous Galerkin Method (PWDG) in the exterior of a bounded domain in $\mathbb{R}^2$. In order to apply the PWDG method, we introduce an artificial…

Numerical Analysis · Mathematics 2016-11-23 Shelvean Kapita , Peter Monk

Outer boundary conditions for strongly and symmetric hyperbolic formulations of 3D Einstein's field equations with a live gauge condition are discussed. The boundary conditions have the property that they ensure constraint propagation and…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Olivier Sarbach , Manuel Tiglio

In this work, we propose a graph-based method implemented on the pulsar timing residuals (PTRs) for stochastic gravitational wave background (SGWB) detection within the nano-Hertz frequency regime and examining uncertainties of its…

Cosmology and Nongalactic Astrophysics · Physics 2026-04-14 M. Alakhras , S. M. S. Movahed

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

The bulk-boundary correspondence is a hallmark feature of topological phases of matter. Nonetheless, our understanding of the correspondence remains incomplete for phases with intrinsic topological order, and is nearly entirely lacking for…

Strongly Correlated Electrons · Physics 2023-12-11 Thomas Schuster , Nathanan Tantivasadakarn , Ashvin Vishwanath , Norman Y. Yao

We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…

Information Theory · Computer Science 2020-11-05 Rui Deng , Jing Zhou , Wenyi Zhang

We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that…

Information Theory · Computer Science 2016-03-16 Jean Barbier , Mohamad Dia , Nicolas Macris

The upper bound on antenna gain is expressed as a sum of lossy characteristic modes, specifically, as a sum of characteristic far fields squared. The procedure combines the favorable properties of Harrington's classical approach to maximum…

Applied Physics · Physics 2023-12-25 Miloslav Capek , Lukas Jelinek

In this paper we explore the possibility of performing Heisenberg limited quantum metrology of a phase, without any prior, by employing only maximally entangled states. Starting from the estimator introduced by Higgins et al. in New J.…

Quantum Physics · Physics 2020-10-27 Federico Belliardo , Vittorio Giovannetti

We propose a new coding scheme using only one lattice that achieves the $\frac{1}{2}\log(1+\SNR)$ capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, when the signal-to-noise ratio $\SNR>e-1$. The scheme…

Information Theory · Computer Science 2018-06-28 Cong Ling , Jean-Claude Belfiore

An important outstanding challenge that must be overcome in order to fully utilize the XY surface code for correcting biased Pauli noise is the phenomena of fragile temporal boundaries that arise during the standard logical state…

Quantum Physics · Physics 2024-08-16 Pei-Kai Tsai , Yue Wu , Shruti Puri

We obtained estimates for first eigenvalues of the Dirichlet boundary value problem for elliptic operators in divergence form (i.e. for the principal frequency of non-homogeneous membranes) in bounded domains $\Omega \subset \mathbb C$…

Analysis of PDEs · Mathematics 2023-01-18 Vladimir Gol'dshtein , Valery Pchelintsev

Plane-wave Trefftz methods (PWB) for the Helmholtz equation offer significant advantages over standard discretization approaches whose implementation employs more general polynomial basis functions. A disadvantage of these methods is the…

Numerical Analysis · Mathematics 2025-09-19 Joseph Coyle , Nilima Nigam

A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a…

Information Theory · Computer Science 2007-07-16 Marat V. Burnashev

By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…

Numerical Analysis · Mathematics 2026-02-06 Ken Mattsson , David Niemelä , Andrew R. Winters

This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altu\u{g} and Wagner is given, and the result is…

Information Theory · Computer Science 2013-10-15 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

A Petrov-Galerkin finite element method is constructed for a singularly perturbed elliptic problem in two space dimensions. The solution contains a regular boundary layer and two characteristic boundary layers. Exponential splines are used…

Numerical Analysis · Mathematics 2023-11-02 Alan F. Hegarty , Eugene O'Riordan

We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified…

Information Theory · Computer Science 2024-03-01 Keshav Goyal , Han Mao Kiah

We obtain conditions for a trigonometric polynomial t of one variable to equal or be approximated by |p|^2 where p has frequencies in a Bohr set of integers obtained by projecting lattice points in the open planar region bounded by the…

Number Theory · Mathematics 2011-10-25 Wayne Lawton
‹ Prev 1 8 9 10 Next ›