Related papers: An Approximation of Theta Functions with Applicati…
The performance of an error correcting code is evaluated by its error probability, rate, and en/decoding complexity. The performance of a series of codes is evaluated by, as the block lengths approach infinity, whether their error…
In this paper, we consider the information-theoretic characterization of the set of achievable rates and distortions in a broad class of multiterminal communication scenarios with general continuous-valued sources and channels. A framework…
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The…
Factor analysis is a classical data reduction technique that seeks a potentially lower number of unobserved variables that can account for the correlations among the observed variables. This paper presents an extension of the factor…
Function-correcting codes are a coding framework designed to minimize redundancy while ensuring that specific functions or computations of encoded data can be reliably recovered, even in the presence of errors. The choice of metric is…
The strong coupling constant alpha_s(mu_0), taken at a fixed reference scale mu_0, is the single free parameter of QCD and should be known to the highest available precision. The value of alpha_s should also be determined with good accuracy…
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain operator space as the quantum generalisation of the adjacency matrix, in terms of…
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser)…
Compute-and-forward (CF) harnesses interference in a wireless networkby allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to…
The Compute-and-Forward protocol in quasi-static channels normally employs lattice codes based on the rational integers $\mathbb{Z}$, Gaussian integers $\mathbb{Z}\left[i\right]$ or Eisenstein integers $\mathbb{Z}\left[\omega\right]$, while…
Standard decoding approaches for conditional text generation tasks typically search for an output hypothesis with high model probability, but this may not yield the best hypothesis according to human judgments of quality. Reranking to…
We present a metric-space approach to quantify the performance of density-functional approximations for interacting many-body systems and to explore the validity of the Hohenberg-Kohn-type theorem on fermionic lattices. This theorem…
We extend a certain type of identities on sums of $I$-Bessel functions on lattices, previously given by G. Chinta, J. Jorgenson, A. Karlsson and M. Neuhauser. Moreover we prove that, with continuum limit, the transformation formulas of…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
Let $f: {\Bbb R}^n \longrightarrow {\Bbb R}$ be a positive definite quadratic form and let $y \in {\Bbb R}^n$ be a point. We present a fully polynomial randomized approximation scheme (FPRAS) for computing $\sum_{x \in {\Bbb Z}^n}…
We study both static and transport properties of model quantum dots, employing density functional theory as well as (numerically) exact methods. For the lattice model under consideration the accuracy of the local-density approximation…
This thesis describes the development of the density matrix embedding theory (DMET) and its applications to lattice strongly correlated electron problems, including a review of DMET theory and algorithms (Ch 2), investigation of finite size…
The partition functions for two-dimensional nearest neighbour Ising model in a non-zero magnetic field have been derived for finite square lattices with the help of graph theoretical procedures, show-bit algorithm, enumeration of…
We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…
We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector ${\bf X}\in\mathbb{R}^n$ in a given lattice. We show that the protocol is optimal in the sense that it…