Related papers: Function-Correcting Codes for Linear and Locally B…
We show that locally repairable codes (LRCs) can be list decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error correction capabilities. The new decoding radius is derived and the…
We use ideas from quantitative homogenization to show that nonconstant harmonic functions on the percolation cluster cannot satisfy certain structural constraints, for example, a Lipschitz bound. These unique-continuation-type results are…
A fixed point result is given for a class of functional contractions over local Branciari metric spaces. It extends some contributions in the area due to Fora et al [Mat. Vesnik, 61 (2009), 203-208].
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
Maximally localized Wannier functions are localized orthogonal functions that can accurately represent given Bloch eigenstates of a periodic system at a low computational cost, thanks to the small size of each orbital. Tight-binding models…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the…
In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ and derive a Singleton-like bound for…
This paper addresses a multi-scale finite element method for second order linear elliptic equations with arbitrarily rough coefficient. We propose a local oversampling method to construct basis functions that have optimal local…
We study local filters for the Lipschitz property of real-valued functions $f: V \to [0,r]$, where the Lipschitz property is defined with respect to an arbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz filters…
In this paper, we determine analytical bounds on the local Lipschitz constants of of affine functions composed with rectified linear units (ReLUs). Affine-ReLU functions represent a widely used layer in deep neural networks, due to the fact…
A development and an application of the localized function method based on the Galerkin method applying a set of Sine functions to approximate the unknown mode fields of the localized modes propagating along the photonic crystal fibres is…
In this paper, we introduce curve-lifted codes over fields of arbitrary characteristic, inspired by Hermitian-lifted codes over $\mathbb{F}_{2^r}$. These codes are designed for locality and availability, and their particular parameters…
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE,…
Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…
Locally repairable codes with availability have become essential components in modern large-scale distributed cloud storage systems and numerous other applications. In this paper, we focus on the construction of locally repairable codes…
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $(2, \delta)$-LRCs over $\mathbb{F}_q$ with flexible…
Upper semicontinuous (usc) functions arise in the analysis of maximization problems, distributionally robust optimization, and function identification, which includes many problems of nonparametric statistics. We establish that every usc…