Related papers: Function-Correcting Codes for Locally Bounded Func…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
This paper studies the problem of safe control of sampled-data systems under bounded disturbance and measurement errors with piecewise-constant controllers. To achieve this, we first propose the High-Order Doubly Robust Control Barrier…
We show that for an entire function $\varphi$ belonging to the Fock space ${\mathscr F}^2(\mathbb{C}^n)$ on the complex Euclidean space $\mathbb{C}^n$, the integral operator \begin{eqnarray*} S_{\varphi}F(z)=\int_{\mathbb{C}^n} F(w) e^{z…
We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…
The local (central) limit theorem precisely describes the behavior of iterated convolution powers of a probability distribution on the $d$-dimensional integer lattice, $\mathbb{Z}^d$. Under certain mild assumptions on the distribution, the…
For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…
The analysis of non-stationary time-series data requires insight into its local and global patterns with physical interpretability. However, traditional smoothing algorithms, such as B-splines, Savitzky-Golay filtering, and Empirical Mode…
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of…
We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…
Locally recoverable codes (LRCs) are classical error-correcting codes widely used in large scale distributed and cloud storage systems. Quantum locally recoverable codes (quantum LRCs) are the quantum counterpart of classical LRCs. They…
We prove the following correction theorem: every function $f$ on the circumference $\mathbb{T}$ that is bounded by the $\alpha_1$-weight $w$ (this means that $Mw^2 \leq C w^2$) can be modified on a set $e$ with $\int\limits_{e} w \leq \eps$…
We introduce a novel lower bound technique for distributed graph algorithms under bandwidth limitations. We define the notion of \emph{fooling views} and exemplify its strength by proving two new lower bounds for triangle membership in the…
In this paper we propose the idea of expanding the space of variations in standard variational calculations for the energy by considering the wave function $\psi$ to be a functional of a set of functions $\chi: \psi = \psi[\chi]$, rather…
Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic…
The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…
The quantum Hamming bound was originally put forward as an upper bound on the parameters of nondegenerate quantum codes, but over the past few decades much work has been done to show that many degenerate quantum codes must also obey this…
A Locally Recoverable Code is a code such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. When we have $\delta$ non overlapping subsets of cardinality $r_i$ that…
We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…
We present a closed-form optimal feedback control method that ensures safety in an a prior unknown and potentially dynamic environment. This article considers the scenario where local perception data (e.g., LiDAR) is obtained periodically,…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…