Related papers: A new design criterion for spherically-shaped divi…
We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in…
The problem of joint detection and lossless source coding is considered. We derive asymptotically optimal decision rules for deciding whether or not a sequence of observations has emerged from a desired information source, and to compress…
We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…
Unitary space-time modulation is known to be an efficient means to communicate over non-coherent Multiple Input Multiple Output (MIMO) channels. In this letter, differential unitary space-time coding and non-coherent space-time coding for…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
This paper develops a unified and computationally efficient method for change-point estimation along the time dimension in a non-stationary spatio-temporal process. By modeling a non-stationary spatio-temporal process as a piecewise…
The goal of this paper is to develop methodology for the systematic analysis of asymptotic statistical properties of data driven DRO formulations based on their corresponding non-DRO counterparts. We illustrate our approach in various…
We study an inverse design problem for the linear multiple fragmentation equation arising in particle dynamics. Our objective is to reconstruct an unknown initial size distribution that evolves, under a prescribed fragmentation law, into a…
Discrete random probability measures are a key ingredient of Bayesian nonparametric inferential procedures. A sample generates ties with positive probability and a fundamental object of both theoretical and applied interest is the…
In distributed optimization and distributed numerical linear algebra, we often encounter an inversion bias: if we want to compute a quantity that depends on the inverse of a sum of distributed matrices, then the sum of the inverses does not…
Score-based methods, such as diffusion models and Bayesian inverse problems, are often interpreted as learning the data distribution in the low-noise limit ($\sigma \to 0$). In this work, we propose an alternative perspective: their success…
We generalize a recent model-independent form factor parameterization derived from rigorous dispersion relations to include constraints from data in the timelike region. These constraints dictate the convergence properties of the…
We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…
This paper proposes to unify fading distributions by modeling the magnitude-squared of the instantaneous channel gain as an infinitely divisible random variable. A random variable is said to be infinitely divisible, if it can be written as…
We consider the problem of inferring the conditional independence graph (CIG) of a sparse, high-dimensional stationary multivariate Gaussian time series. A sparse-group lasso-based frequency-domain formulation of the problem based on…
A finite difference numerical method is investigated for fractional order diffusion problems in one space dimension. For this, a mathematical model is developed to incorporate homogeneous Dirichlet and Neumann type boundary conditions. The…
We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…
In this work, we study the Codeword Stabilized Quantum Codes (CWS codes) a generalization of the stabilizers quantum codes using a new approach, the algebraic structure of modules, a generalization of linear spaces. We show then a new…
Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In…
This paper revisits a fundamental problem in statistical inference from a non-asymptotic theoretical viewpoint $\unicode{x2013}$ the construction of confidence sets. We establish a finite-sample bound for the estimator, characterizing its…