Related papers: Duality and LP Bounds for Codes with Locality
Duality is one of the oldest known symmetries of Maxwell equations. In recent years the significance of duality symmetry has been recognized in superstrings and high energy physics and there has been a renewed interest on the question of…
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. A traditional approach is to look for codes which simultaneously maximize error tolerance and minimize storage space consumption. However, this…
This talk presents work concepts and results for the determination of the fine structure constant $\alpha$ at the $Z_0$ mass resonance. The problem consisting of the break-down of global duality for singular integral weights is circumvented…
In this paper we study local cohomology of finitely generated bigraded modules over a standard bigraded ring with respect to the irrelevant bigraded ideals and establish a duality theorem. Several applications are considered.
A code is locally recoverable when each symbol in one of its code words can be reconstructed as a function of $r$ other symbols. We use bundles of projective spaces over a line to construct locally recoverable codes with availability; that…
In recent years, locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear locally repairable codes can significantly reduce the complexity of both…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery…
Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node,…
Classical locally recoverable codes, which permit highly efficient recovery from localized errors as well as global recovery from larger errors, provide some of the most useful codes for distributed data storage in practice. In this paper,…
We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields…
In this paper, the authors establish the two-weight boundedness of the local fractional maximal operators and local fractional integrals on Gaussian measure spaces associated with the local weights. More precisely, the authors first obtain…
Recently, Meierfrankenfeld has published three theorems on the cohomology of a finitary module. They cover the local determination of complete reducibility; the local splitting of group extensions; and the representation of locally split…
We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from…
For a code $\code$, its $i$-th symbol is said to have locality $r$ if its value can be recovered by accessing some other $r$ symbols of $\code$. Locally repairable codes (LRCs) are the family of codes such that every symbol has locality…
This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…
We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…
We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in…
We study a new set of duality relations between weighted, combinatoric invariants of a graph $G$. The dualities arise from a non-linear transform $\mathfrak{B}$, acting on the weight function $p$. We define $\mathfrak{B}$ on a space of…
Among diversity of frameworks and constructions introduced in Loewner Theory by different authors, one can distinguish two closely related but still different ways of reasoning, which colloquially may be described as "increasing" and…