Related papers: Function-Correcting Codes for Linear and Locally B…
In a {\em locally recoverable} or {\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed…
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over…
The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in \cite{q} and derive an…
In this work, we prove some trace theorems for function spaces with a nonlocal character that contain the classical $W^{s,p}$ space as a subspace. The result we obtain generalizes well known trace theorems for $W^{s,p}(\Omega)$ functions…
Certified robustness is a desirable property for deep neural networks in safety-critical applications, and popular training algorithms can certify robustness of a neural network by computing a global bound on its Lipschitz constant.…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
An effective potential function is critical for protein structure prediction and folding simulation. Simplified protein models such as those requiring only $C_\alpha$ or backbone atoms are attractive because they enable efficient search of…
Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,\delta)$-locality that achieve the equality in the Singleton-type…
We introduce function-correcting partition codes (FCPCs), which are a natural generalization of function-correcting codes (FCCs). An FCPC is defined directly on a partition of the message space, rather than on a specific target function. We…
We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message…
We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we…
In this paper, we introduce and analyze a lowest-order locking-free weak Galerkin (WG) finite element scheme for the grad-div formulation of linear elasticity problems. The scheme uses linear functions in the interior of mesh elements and…
The statistics of critical spin-spin correlation functions in Ising systems with non-frustrated disorder are investigated on a strip geometry, via numerical transfer-matrix techniques. Conformal invariance concepts are used, in order to…
In this contribution we are interested in the quantitative homogenization properties of linear elliptic equations with homogeneous Dirichlet boundary data in polygonal domains with corners. To begin our study of this situation, we consider…
We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…
The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…
This paper proposes a novel localized Fourier extension method for approximating non-periodic functions via domain segmentation. By partitioning the computational domain into subregions with uniform discretization scales, the method…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…